Label-guided graph exploration by a finite automaton

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 335-346

  Cohen, Reuven ^a   Fraigniaud, Pierre ^b   Ilcinkas, David ^b   Korman, Amos ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; ROBOTS; TOPOLOGY;

FINITE AUTOMATON; LABEL-GUIDED GRAPH EXPLORATION; NODES;

AUTOMATA THEORY;

EID: 26444483301     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_28     Document Type: Conference Paper

References (10)

1. M. Blum and D. Kozen. On the power of the compass (or, why mazes are easier to search than graphs). In 19th Symposium on Foundations of Computer Science (FOCS), pages 132-142, 1978.
2. L. Budach. Automata and labyrinths. Math. Nachrichten, pages 195-282, 1978.
3. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc. Tree Exploration with Little Memory. In 13th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 588-597, 2002.
4. P. Fraigniaud, D. Ilcinkas, A. Pelc, G. Peer and D. Peleg. Graph Exploration by a Finite Automaton. In Proc. 29th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), LNCS 3153, 451-462, 2004.
5. D. Kozen. Automata and planar graphs. In Fund. Computat. Theory (FCT), 243-254, 1979.
6. Fundamentals of Computation Theory (FCT), pages 243-254, 1979.
7. M.O. Rabin, Maze threading automata. Seminar talk presented at the University of California at Berkeley, October 1967.
8. H.A. Rollik. Automaten in planaren Graphen. Acta Informatica 13:287-298, 1980
9. (also in LNCS 67, pages 266-275, 1979).
10. C. E. Shannon. Presentation of a maze-solving machine. In 8th Conf. of the Josiah Macy Jr. Found. (Cybernetics), pages 173-180, 1951.