Skip to main content

Environments, labyrinths and automata

  • Section A Algebraic & Constructive Theory of Machines, Computations and Languages
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 56))

Included in the following conference series:

  • 337 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Budach, On the Solution of the labyrinth Problem for Finite Automata, EIK 11 (1975), 10–12, 661–672

    Google Scholar 

  2. —, Automata and Labyrinths, Mimeographed notes (Math. Nachr., forthcoming)

    Google Scholar 

  3. V.M. Gluskov, A.A. Letičevskij, Teorija diskretnych preobrazovatelej, Selected Questions of Algebra and Logic, Nauka, Novosibirsk 1973

    Google Scholar 

  4. W.J. Savitch, Maze Recognizing Automata and Nondeterministic Tape Complexity, J. of Computer and System Science 7 (1973), 389–403

    Google Scholar 

  5. C.P. Schnorr, Rekursive Funktionen ünd ihre Komplexität Teubner, Stuttgart, 1974

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marek Karpiński

Rights and permissions

Reprints 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

Publish with us

Policies and ethics