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
Stability of subshifts in cellular automata
Fundamenta Informaticae - Special issue on cellular automata
Cellular Automata: A Discrete Universe
Cellular Automata: A Discrete Universe
Cellular automata with vanishing particles
Fundamenta Informaticae - Special issue on cellular automata
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Defect particle kinematics in one-dimensional cellular automata
Theoretical Computer Science
Self-organization in cellular automata: a particle-based approach
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Hi-index | 0.00 |
Let A^{Z^D} be the Cantor space of Z^D-indexed configurations ina finite alphabet A, and let σ be the Z^D-action of shifts onA^{Z^D}. A cellular automaton is a continuous, σ-commutingself-map Φ of A^{Z^D}, and a Φ-invariant subshift is aclosed, (Φ, σ)-invariant subset u ⊂ A^{Z^D}. Supposea ε A^{Z^D} is u-admissible everywhere except for somesmall region we call a defect. It has been empirically observedthat such defects persist under iteration of Φ, and oftenpropagate like 'particles' which coalesce or annihilate on contact.We use spectral theory to explain the persistence of some defectsunder Φ, and partly explain the outcomes of theircollisions.