Tilings and patterns
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
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Cellular Automata: A Discrete Universe
Cellular Automata: A Discrete Universe
Cellular automata with vanishing particles
Fundamenta Informaticae - Special issue on cellular automata
Stability of subshifts in cellular automata
Fundamenta Informaticae - Cellular Automata
Hi-index | 0.00 |
Let $A^{Z^D}$ be the Cantor space of $Z^D$-indexed configurations in a finite alphabet A, and let σ be the $Z^D$-action of shifts on $A^{Z^D}$. A cellular automaton is a continuous, σ-commuting self-map Φ of $A^{Z^D}$, and a Φ-invariant subshift is a closed, (Φ, σ)-invariant subset u ⊂ $A^{Z^D}$. Suppose a ∈ $A^{Z^D}$ is u-admissible everywhere except for some small region we call a defect. It has been empirically observed that such defects persist under iteration of Φ, and often propagate like 'particles' which coalesce or annihilate on contact. We use spectral theory to explain the persistence of some defects under Φ, and partly explain the outcomes of their collisions.