Skip to main content
SpringerLink
Log in

Remarks on searching labyrinths by automata

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum,M.,D.Kozen, On the power of the compass. Proc. 19th IEEE FOCS Conf. (1978), 132–142.

    Google Scholar 

  2. Blum,M.,W.Sakoda, On the capability of finite automata in 2 and 3 dimensional space. Proc. 17th IEEE FOCS Conf. (1977), 147–161.

    Google Scholar 

  3. Budach, L., Automata and labyrinths. Math. Nachr. 86 (1978), 195–283.

    Google Scholar 

  4. Coy, W., Of Mice and Maze. EIK 14 (1978) 5, 227–232.

    Google Scholar 

  5. Habasiński,Z.,M.Karpiński, A Codification of Blum-Sakoda 7 Pebbles Algorithm. ICS PAS Repts. 448, Warszawa, 1981.

    Google Scholar 

  6. Hoffmann,F., One pebble does not suffice to search plane labyrinths. In: Fundamentals of Computation Theory; 1981 International FCT — Conference, Szeged 1981 (Ed. F. Geczeg); Lecture Notes in Computer Science, 117; Berlin — Heidelberg — New-York 1981; pp. 433–444.

    Google Scholar 

  7. Muller, H., Automata Catching Labyrinths with at most Three Components. EIK 15 (1979) 1/2, 3–9.

    Google Scholar 

  8. Szepietowski,A., Remarks on Searching Plane Labyrinths by 1-pebble-automata. Proc. of Workshop on Algorithms and Comp. Theory, Poznań 1981, pp. 49–50.

    Google Scholar 

  9. Szepietowski, A., On Searching Plane Labyrinths by 1-Pebble-Automata. EIK 19 (1983) 1/2, 79–84.

    Google Scholar 

  10. Szepietowski, A., A Finite 5-Pebble-Automaton Can Search Every Maze. IPL 15/5 (1982), 199–204.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Technical University of Gdańsk, Majakowskiego 11/12, Gdańsk, Poland

    Andrzej Szepietowski

Authors
  1. Andrzej Szepietowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szepietowski, A. (1983). Remarks on searching labyrinths by automata. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_126

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_126

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation