Skip to main content

Automaten in planaren graphen

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Theoretical Computer Science 4th GI Conference

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 67))

Abstract

For any finite set of automata there is a planar graph which the automata together cannot search.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. Literatur

  1. M. Blum, D. Kozen, "On the power of the compass", 19th IEEE FOCS 1978

    Google Scholar 

  2. M. Blum, W. Sakoda, "On the capability of finite automata in 2 and 3 dimensional space", Proc. 17th IEEE Conf. (1977), 147–161

    Google Scholar 

  3. L. Budach, "Automata and labyrinths", unveröffentlichtes Manuskript, 1974

    Google Scholar 

  4. H. Müller, "Endliche Automaten und Labyrinthe", EIK 7 (1971) 4, 261–264.

    Google Scholar 

Download references

Authors

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rollik, H.A. (1979). Automaten in planaren graphen. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09118-9

  • Online ISBN: 978-3-540-35517-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics