On Searching of Special Cases of Mazes and Finite Embedded Graphs

[1]  Horst Müller,et al.  Endliche Automaten und Labyrinthe , 1971, J. Inf. Process. Cybern..

[2]  Horst Müller.  Automata Catching Labyrinths with at most Three Components , 1979, J. Inf. Process. Cybern..

[3]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[4]  Frank Hoffmann.  One Pebble Does Not Suffice to Search Plane Labyrinths , 1981, FCT.

[5]  Andrzej Szepietowski.  Remarks on Searching Labyrinths by Automata , 1983, FCT.