Abstract
For any finite set of automata there is a planar graph which the automata together cannot search.
Preview
Unable to display preview. Download preview PDF.
5. Literatur
M. Blum, D. Kozen, "On the power of the compass", 19th IEEE FOCS 1978
M. Blum, W. Sakoda, "On the capability of finite automata in 2 and 3 dimensional space", Proc. 17th IEEE Conf. (1977), 147–161
L. Budach, "Automata and labyrinths", unveröffentlichtes Manuskript, 1974
H. Müller, "Endliche Automaten und Labyrinthe", EIK 7 (1971) 4, 261–264.
Editor information
Rights 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