The following pages link to Automata and Labyrinths (Q4191609):
Displaying 28 items.
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Setting port numbers for fast graph exploration (Q935169) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Anonymous graph exploration without collision by mobile robots (Q975538) (← links)
- Embedding rectilinear graphs in linear time (Q1111399) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q2220396) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- Graph decomposition for memoryless periodic exploration (Q2429354) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← links)
- Graph Decomposition for Improving Memoryless Periodic Exploration (Q3182950) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- On the Power of Local Orientations (Q3511395) (← links)
- On reduction of automata in labyrinths (Q4985608) (← links)
- Shape recognition by a finite automaton robot (Q5005154) (← links)
- (Q5075773) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q5090903) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs (Q6178459) (← links)
- Tight bounds for deterministic high-dimensional grid exploration (Q6535010) (← links)
- Graph exploration by a deterministic memoryless automaton with pebbles (Q6585255) (← links)
