Two pebbles don't suffice

  • Lothar Budach
Appendix Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Natural Number Local Information Goal Node Shift Operator Pictorial Representation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Budach, L., Automata and labyrinths. Math. Nachr. 86/1978/195–282.Google Scholar
  2. 2.
    Budach, L., On the solution of the labyrinth problem for finite automata. EIK 11/1975/, 661–672.Google Scholar
  3. 3.
    Budach, L., Environments, labyrinths and automata. Lecture notes in Computer Science 56/1977/, 54–64.Google Scholar
  4. 4.
    Budach, L. and Meinel, Ch., Umwelten und Automaten in Umwelten. Seminarberichte der Sektion Mathematik der Humboldt Universität 23/1980.Google Scholar
  5. 5.
    Budach, L. and Meinel, Ch., Environments and automata. EIK, in printGoogle Scholar
  6. 6.
    Budach, L. and Waack, S., On the halting problem for automata in cones. EIK, in printGoogle Scholar
  7. 7.
    Eilenberg, S., Automata, languages and machines. Vol. A, B. Academic Press, New York, 1974Google Scholar
  8. 8.
    Savitch, W., Relations between nondeterministic and deterministic tape complexities. Journal of Computer and System Science 4/1970/177–192.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Lothar Budach
    • 1
  1. 1.Sektion Mathematik der Humboldt UniversitätBerlin

Personalised recommendations