Automata and Labyrinths
From MaRDI portal
Publication:4191609
DOI10.1002/mana.19780860120zbMath0405.68049OpenAlexW2054224855MaRDI QIDQ4191609
Publication date: 1978
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19780860120
Learning and adaptive systems in artificial intelligence (68T05) Categories of machines, automata (18B20)
Related Items (27)
Memory Efficient Anonymous Graph Exploration ⋮ Graph Decomposition for Improving Memoryless Periodic Exploration ⋮ A survey of two-dimensional automata theory ⋮ Embedding rectilinear graphs in linear time ⋮ Homomorphisms on graph-walking automata ⋮ Homomorphisms and inverse homomorphisms on graph-walking automata ⋮ On the Power of Local Orientations ⋮ State complexity of transforming graph-walking automata to halting, returning and reversible ⋮ 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 ⋮ Reversibility of computations in graph-walking automata ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Building a nest by an automaton ⋮ Fast periodic graph exploration with constant memory ⋮ Setting port numbers for fast graph exploration ⋮ Shape recognition by a finite automaton robot ⋮ 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 ⋮ On reduction of automata in labyrinths ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Graph exploration by a finite automaton ⋮ State complexity of union and intersection on graph-walking automata
Cites Work
This page was built for publication: Automata and Labyrinths
