scientific article; zbMATH DE number 194193
From MaRDI portal
Publication:4040986
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)
Recommendations
Cited in
(24)- Improvements on printing mice in labyrinths
- The jubilee maze
- Illuminating labyrinths.
- Building a nest by an automaton
- Graph exploration by a finite automaton
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
- Mathematical Labyrinths. Pathfinding
- Solving the KO labyrinth
- scientific article; zbMATH DE number 3972189 (Why is no real title available?)
- On behaviour of automata in labyrinths
- Navigation Without Perception of Coordinates and Distances
- scientific article; zbMATH DE number 647644 (Why is no real title available?)
- Collectives of automata in labyrinths
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
- Building a nest by an automaton
- Behavior of finite automata in mazes
- scientific article; zbMATH DE number 3895120 (Why is no real title available?)
- Labyrinth: From Literature to Algorithms
- Derandomizing random walks in undirected graphs using locally fair exploration strategies
- Directional movement of a collective of compassless automata on a square lattice of width 2
- Exploration of convex terrains by a deterministic automaton with pebbles
- Exploring wedges of an oriented grid by an automaton with pebbles
- Setting port numbers for fast graph exploration
- Impact of memory size on graph exploration capability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040986)
