Preview
Unable to display preview. Download preview PDF.
References
Budach, L., Automata and labyrinths. Math. Nachr. 86/1978/195–282.
Budach, L., On the solution of the labyrinth problem for finite automata. EIK 11/1975/, 661–672.
Budach, L., Environments, labyrinths and automata. Lecture notes in Computer Science 56/1977/, 54–64.
Budach, L. and Meinel, Ch., Umwelten und Automaten in Umwelten. Seminarberichte der Sektion Mathematik der Humboldt Universität 23/1980.
Budach, L. and Meinel, Ch., Environments and automata. EIK, in print
Budach, L. and Waack, S., On the halting problem for automata in cones. EIK, in print
Eilenberg, S., Automata, languages and machines. Vol. A, B. Academic Press, New York, 1974
Savitch, W., Relations between nondeterministic and deterministic tape complexities. Journal of Computer and System Science 4/1970/177–192.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Budach, L. (1981). Two pebbles don't suffice. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_126
Download citation
DOI: https://doi.org/10.1007/3-540-10856-4_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10856-6
Online ISBN: 978-3-540-38769-5
eBook Packages: Springer Book Archive