Advertisement

Automaten in planaren graphen

  • H. A. Rollik
Vorträge (In Alphabetischer Reihenfolge)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)

Abstract

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

Keywords

IEEE FOCS 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. Literatur

  1. 1.
    M. Blum, D. Kozen, "On the power of the compass", 19th IEEE FOCS 1978Google Scholar
  2. 2.
    M. Blum, W. Sakoda, "On the capability of finite automata in 2 and 3 dimensional space", Proc. 17th IEEE Conf. (1977), 147–161Google Scholar
  3. 3.
    L. Budach, "Automata and labyrinths", unveröffentlichtes Manuskript, 1974Google Scholar
  4. 4.
    H. Müller, "Endliche Automaten und Labyrinthe", EIK 7 (1971) 4, 261–264.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • H. A. Rollik

There are no affiliations available

Personalised recommendations