Automaten in planaren Graphen

DOI10.1007/BF00288647zbMath0442.68046OpenAlexW3023568255MaRDI QIDQ1143798

H. A. Rollik

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00288647

zbMATH Keywords

labyrinthautomata in planar graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (20)

Memory Efficient Anonymous Graph Exploration ⋮ Graph Decomposition for Improving Memoryless Periodic Exploration ⋮ The ANTS problem ⋮ Exploration of Time-Varying Connected Graphs with Silent Agents ⋮ Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs ⋮ Graph decomposition for memoryless periodic exploration ⋮ A time to cast away stones ⋮ More efficient periodic traversal in anonymous undirected graphs ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Building a nest by an automaton ⋮ Distributed chasing of network intruders ⋮ Fast periodic graph exploration with constant memory ⋮ Setting port numbers for fast graph exploration ⋮ LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS ⋮ Impact of memory size on graph exploration capability ⋮ Unnamed Item ⋮ Anonymous graph exploration without collision by mobile robots ⋮ Energy Consumption of Group Search on a Line ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs ⋮ Graph exploration by a finite automaton

Cites Work

• Unnamed Item

This page was built for publication: Automaten in planaren Graphen