Pages that link to "Item:Q2575752"
From MaRDI portal
The following pages link to Graph exploration by a finite automaton (Q2575752):
Displaying 17 items.
- Mathematical Foundations of Computer Science 2004 (Q5311120) (← links)
- Structural Information and Communication Complexity (Q5710080) (← links)
- Automata, Languages and Programming (Q5716786) (← links)
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots (Q5918539) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- A general lower bound for collaborative tree exploration (Q5919423) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
- Efficient live exploration of a dynamic ring with mobile robots (Q6069843) (← links)
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles (Q6155234) (← links)
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs (Q6178459) (← links)
- Exploring a Dynamic Ring Without Landmark (Q6488444) (← links)
- Exploration of High-Dimensional Grids by Finite State Machines (Q6492093) (← links)
- Tight bounds for deterministic high-dimensional grid exploration (Q6535010) (← links)
- Evacuation of equilateral triangles by mobile agents of limited communication range (Q6536151) (← links)
- Fast dispersion of mobile robots on arbitrary graphs (Q6536152) (← links)
- Black hole search in dynamic cactus graph (Q6575403) (← links)
- Graph exploration by a deterministic memoryless automaton with pebbles (Q6585255) (← links)