Preview
Unable to display preview. Download preview PDF.
References
L. Budach, On the Solution of the labyrinth Problem for Finite Automata, EIK 11 (1975), 10–12, 661–672
—, Automata and Labyrinths, Mimeographed notes (Math. Nachr., forthcoming)
V.M. Gluskov, A.A. Letičevskij, Teorija diskretnych preobrazovatelej, Selected Questions of Algebra and Logic, Nauka, Novosibirsk 1973
W.J. Savitch, Maze Recognizing Automata and Nondeterministic Tape Complexity, J. of Computer and System Science 7 (1973), 389–403
C.P. Schnorr, Rekursive Funktionen ünd ihre Komplexität Teubner, Stuttgart, 1974
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Budach, L. (1977). Environments, labyrinths and automata. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_70
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive