Automata in labyrinths

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


Turing Machine Node Degree Finite Automaton Output Sequence Initial Node 
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/.
    Kobrinski, N.E. & Trachtenbrot, B.A., Einführung in die Theorie endlicher Automaten, pp. 268–276, Akademie-Verlag, Berlin (DDR), 1967.Google Scholar
  2. /2/.
    Döpp, K., Automaten in Labyrinthen, EIK 7:2, pp. 79–94, and 7:3, pp. 167–190, 1971.Google Scholar
  3. /3/.
    Müller, H., Endliche Automaten und Labyrinthe, EIK 7:4, pp. 261–264, 1971.Google Scholar
  4. /4/.
    Budach, L., On the solution of the labyrinth problem for finite automata, EIK 11:10–12, pp. 661–672, 1975.Google Scholar
  5. /5/.
    Budach, L., Labyrinths and Automata, to appear.Google Scholar
  6. /6/.
    Coy, W., Of mice and maze, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Wolfgang Coy
    • 1
  1. 1.Institut de Programmationuniversité de Paris VIParisFrance

Personalised recommendations