Shape recognition by a finite automaton robot
From MaRDI portal
Publication:5005154
DOI10.4230/LIPIcs.MFCS.2018.52OpenAlexW2889401322MaRDI QIDQ5005154
Irina Kostitsyna, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Dorian Rudolph, Christian Scheideler
Publication date: 4 August 2021
Full work available at URL: https://doi.org/10.4230/lipics.mfcs.2018.52
Related Items (4)
Building a nest by an automaton ⋮ CADbots: algorithmic aspects of manipulating programmable matter with finite automata ⋮ Forming tile shapes with simple robots ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots
Cites Work
- An introduction to tile-based self-assembly and a survey of recent results
- Universal coating for programmable matter
- An annotated bibliography on guaranteed graph searching
- On the periodicity of an arithmetical function
- Autonomous programmable DNA nanorobotic devices using DNAzymes
- Forming tile shapes with simple robots
- A class of universal linear bounded automata
- Graph exploration by a finite automaton
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Automata and Labyrinths
- Independent systems of automata in labyrinths
- Collectives of automata in labyrinths
- DNA Sticky End Design and Assignment for Robust Algorithmic Self-assembly
- On the interval containing at least one prime number
- Simple and efficient local codes for distributed stable network construction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Shape recognition by a finite automaton robot
