Automaten in planaren Graphen
From MaRDI portal
Publication:1143798
DOI10.1007/BF00288647zbMath0442.68046MaRDI QIDQ1143798
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288647
68Q45: Formal languages and automata
Related Items
LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS, Unnamed Item, Exploration of Time-Varying Connected Graphs with Silent Agents, Energy Consumption of Group Search on a Line, Memory Efficient Anonymous Graph Exploration, More efficient periodic traversal in anonymous undirected graphs, Distributed chasing of network intruders, Fast periodic graph exploration with constant memory, Setting port numbers for fast graph exploration, Impact of memory size on graph exploration capability, Anonymous graph exploration without collision by mobile robots, Searching for a black hole in arbitrary networks: optimal mobile agents protocols, Building a nest by an automaton, The ANTS problem, Graph decomposition for memoryless periodic exploration, Graph exploration by a finite automaton, Graph Decomposition for Improving Memoryless Periodic Exploration, More Efficient Periodic Traversal in Anonymous Undirected Graphs
Cites Work
