Environments, labyrinths and automata

  • Lothar Budach
Section A Algebraic & Constructive Theory of Machines, Computations and Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Automorphism Group Turing Machine Partial Function Finite Automaton Congruence Relation 
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]
    L. Budach, On the Solution of the labyrinth Problem for Finite Automata, EIK 11 (1975), 10–12, 661–672Google Scholar
  2. [2]
    —, Automata and Labyrinths, Mimeographed notes (Math. Nachr., forthcoming)Google Scholar
  3. [3]
    V.M. Gluskov, A.A. Letičevskij, Teorija diskretnych preobrazovatelej, Selected Questions of Algebra and Logic, Nauka, Novosibirsk 1973Google Scholar
  4. [4]
    W.J. Savitch, Maze Recognizing Automata and Nondeterministic Tape Complexity, J. of Computer and System Science 7 (1973), 389–403Google Scholar
  5. [5]
    C.P. Schnorr, Rekursive Funktionen ünd ihre Komplexität Teubner, Stuttgart, 1974Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Lothar Budach
    • 1
  1. 1.Humboldt UniversityBerlin

Personalised recommendations