A Language for Particle Interactions in Rule 54 and Other Cellular Automata
From MaRDI portal
Abstract: This is a study of localised structures in one-dimensional cellular automata, with the elementary cellular automaton Rule 54 as a guiding example. A formalism for particles on a periodic background is derived, applicable to all one-dimensional cellular automata. One can compute which particles collide and in how many ways. One can also compute the fate of a particle after an unlimited number of collisions - whether they only produce other particles, or the result is a growing structure that destroys the background pattern. For Rule 54, formulas for the four most common particles are given and all two-particle collisions are found. We show that no other particles arise, which particles are stable and which can be created, provided that only two particles interact at a time. More complex behaviour of Rule 54 requires therefore multi-particle collisions.
Recommendations
- Non-deterministic cellular automata and languages
- Formal languages and global cellular automaton behavior
- Particle structures in elementary cellular automaton rule 146
- scientific article; zbMATH DE number 2166280
- Bounded languages meet cellular automata with sparse communication
- A GROUP INTERPRETATION OF PARTICLES GENERATED BY ONE-DIMENSIONAL CELLULAR AUTOMATON, WOLFRAM'S RULE 54
- Languages, equicontinuity and attractors in cellular automata
- scientific article; zbMATH DE number 4070371
- Two-dimensional languages and cellular automata
Cited in
(9)- Complete characterization of structure of rule 54
- Interaction of Simple Particles in Soliton Cellular Automata
- Particle structures in elementary cellular automaton rule 146
- On the Representation of Gliders in Rule 54 by De Bruijn and Cycle Diagrams
- Persistent structures in elementary cellular automaton rule 146
- A GROUP INTERPRETATION OF PARTICLES GENERATED BY ONE-DIMENSIONAL CELLULAR AUTOMATON, WOLFRAM'S RULE 54
- On soliton collisions between localizations in complex elementary cellular automata: rules 54 and 110 and beyond
- Integrability breaking in the rule 54 cellular automaton
- Upper bound on the products of particle interactions in cellular automata
This page was built for publication: A Language for Particle Interactions in Rule 54 and Other Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5126832)