Skip to main content
SpringerLink
Log in

On searching of special classes of mazes and finite embedded graphs

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

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.,Kozen,D., On the power of compass. 19th IEEE FOCS Conference, 1978, 132–142

    Google Scholar 

  2. Hemmerling,A., 1-pointer automata searching finite embedded graphs. will be published in Zeitschr. f. math. Logik und Grundlagen d. Math.

    Google Scholar 

  3. Hoffmann, F., One pebble does not suffice to search planar labyrinths. Proc. FCT'81, Lect. Notes in Comp. Sc. 117 (1981), 433–444

    Google Scholar 

  4. Hoffmann, F.,Kriegel, K., Two more results on labyrinths. Short Communic. of the Internat. Congr. of Mathematicians, Warsaw 1983, XII, p. 52

    Google Scholar 

  5. Kriegel,K., Universelle 1-Kiesel-Automaten für k-komponentige Labyrinthe. to appear as Report R-MATH-04/84, AdW der DDR, Berlin

    Google Scholar 

  6. Müller, H., Endliche Automaten und Labyrinthe. EIK 7 (1971), 146–160

    Google Scholar 

  7. Müller, H., Automata catching labyrinths with at most three components. EIK 15 (1979), 3–9

    Google Scholar 

  8. Szepietowski, A., Remarks on searching labyrinths by automata. Proc. FCT'83, Lect. Notes in Comp. Sc. 158 (1983), 457–464

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik der Ernst-Moritz-Arndt-Universität, DDR-2200, Greifswald,Jahnstraße

    A. Hemmerling

  2. Institut für Mathematik der Akademie der Wissenschaften der DDR, DDR-1086, Berlin,Mohrenstraße

    K. Kriegel

Authors
  1. A. Hemmerling
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Kriegel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hemmerling, A., Kriegel, K. (1984). On searching of special classes of mazes and finite embedded graphs. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030310

Download citation

  • DOI: https://doi.org/10.1007/BFb0030310

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation