Space lower bounds for graph exploration via reduced automata

Lecture Notes in Computer Science

Volumn 3499, Issue , 2005, Pages 140-154

  Fraigniaud, Pierre ^a   Ilcinkas, David ^a   Rajsbaum, Sergio ^b   Tixeuil, Sébastien ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Finite automaton; Graph exploration; Mobile agent; Robot

Indexed keywords

ALGORITHMS; FINITE AUTOMATA; KNOWLEDGE ACQUISITION; MOBILE ROBOTS; STORAGE ALLOCATION (COMPUTER); TOPOLOGY;

GRAPH EXPLORATION; MOBILE AGENTS; NON-COOPERATIVE ROBOTS; REDUCED AUTOMATA;

GRAPH THEORY;

EID: 24944488808     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11429647_13     Document Type: Conference Paper

References (8)

1. M. Bender, A. Fernandez, D. Ron, A. Sahai and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. Information and Computation 176: 1-21, 2002. Prel. Version in STOC 1998.
2. M. Bender and D. Slonim. The power of team exploration: Two robots can learn unlabeled directed graphs. In 35th Ann. Symp. on Foundations of Computer Science (FOCS), pages 75-85, 1994.
3. L. Budach. Automata and labyrinths. Math. Nachrichten, pages 195-282, 1978.
4. 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.
5. G. Dudek, M. Jenkins, E. Milios, and D. Wilkes. Robotic Exploration as Graph Construction. IEEE Transaction on Robotics and Automation 7(6): 859-865, 1991.
6. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg. Graph Exploration by a Finite Automaton. In 29th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 3153, pages 451-462, 2004.
7. H.-A. Rollik. Automaten in planaren graphen. Acta Informatica 13: 287-298, 1980.
8. C.-E. Shannon. Presentation of a Maze-Solving Machine. In 8th Conf. of the Josiah Macy Jr. Found. (Cybernetics), pages 173-180, 1951.