Soliton-like behavior in automata
Physica D
Cellular automata for contour dynamics
Physica D
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Computational mechanics of cellular automata: an example
Proceedings of the workshop on Lattice dynamics
Regular Article: Cellular Automaton Growth on Z2: Theorems, Examples, and Problems
Advances in Applied Mathematics
A new kind of science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Mechanisms of Emergent Computation in Cellular Automata
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Genetic Algorithm Discovers Particle-Based Computation in Cellular Automata
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Cellular Automata: A Discrete Universe
Cellular Automata: A Discrete Universe
Almost periodic configurations on linear cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Spectral Domain Boundaries in Cellular Automata
Fundamenta Informaticae - Special issue on DLT'04
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Self-organization in cellular automata: a particle-based approach
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Hi-index | 5.23 |
Let A^Z be the Cantor space of bi-infinite sequences in a finite alphabet A, and let @s be the shift map on A^Z. A cellular automaton is a continuous, @s-commuting self-map @F of A^Z, and a @F-invariant subshift is a closed, (@F,@s)-invariant subset S@?A^Z. Suppose a@?A^Z is S-admissible everywhere except for some small region we call a defect. It has been empirically observed that such defects persist under iteration of @F, and often propagate like 'particles'. We characterize the motion of these particles, and show that it falls into several regimes, ranging from simple deterministic motion, to generalized random walks, to complex motion emulating Turing machines or pushdown automata. One consequence is that some questions about defect behaviour are formally undecidable.