Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
From MaRDI portal
Publication:1596777
DOI10.1016/S0895-7177(98)00156-3zbMath0993.68127OpenAlexW2055905380WikidataQ127872426 ScholiaQ127872426MaRDI QIDQ1596777
Owen Holland, Andrew Adamatzky
Publication date: 5 May 2002
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(98)00156-3
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Cellular automata (computational aspects) (68Q80)
Related Items
A fast robust algorithm for computing discrete Voronoi diagrams ⋮ Constructions in swarms ⋮ CHOOSEY HOT SAND: REFLECTION OF GRAIN SENSITIVITY ON PATTERN MORPHOLOGY ⋮ Morphology of patterns of lattice swarms: interval parameterization.
Cites Work
- The complexity of computing the permanent
- Time-space tradeoffs for undirected graph traversal by graph automata
- Critical growth phenomena in cellular automata
- Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
- A fast randomized LOGSPACE algorithm for graph connectivity
- Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms
- Phenomenology of excitation in 2-D cellular automata and swarm systems
- Random walks on generalized lattices
- Voronoi-like partition of lattice in cellular automata
- Statistical mechanics of probabilistic cellular automata.
- The incomplete Voronoĭ diagram and percolation analysis
- Games between automata
- Relationships between nondeterministic and deterministic tape complexities
- Description of games of \(\epsilon\)-automata
- Space Lower Bounds for Maze Threadability on Restricted Machines
- Computational Complexity of Probabilistic Turing Machines
- Broadcasting in random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
