# On Soliton Collisions between Localizations in Complex Elementary Cellular Automata: Rules 54 and 110 and Beyond

@article{Martnez2012OnSC, title={On Soliton Collisions between Localizations in Complex Elementary Cellular Automata: Rules 54 and 110 and Beyond}, author={Genaro Ju{\'a}rez Mart{\'i}nez and Andrew I. Adamatzky and Fangyue Chen and Leon Ong Chua}, journal={Complex Syst.}, year={2012}, volume={21} }

In this paper we present a single-soliton two-component cellular automata (CA) model of waves as mobile self-localizations, also known as: particles, waves, or gliders; and its version with memory. The model is based on coding sets of strings where each chain represents a unique mobile self-localization. We will discuss briefly the original soliton models in CA proposed with {\it filter automata}, followed by solutions in elementary CA (ECA) domain with the famous universal ECA {\it Rule 110…

## Figures and Tables from this paper

## 13 Citations

### Computing with virtual cellular automata collider

- Computer Science2015 Science and Information Conference (SAI)
- 2015

Computer models of nano-scale computing circuits based on propagation of localised excitations or defects in complexes of polymer chain rings based on collisions that emulate basic types of interactions between localisations typical for spatially-extended non-linear media are presented.

### Random Expansion Method for the Generation of Complex Cellular Automata

- Computer ScienceInf. Sci.
- 2021

### Complete Characterization of Structure of Rule 54

- PhysicsComplex Syst.
- 2014

A way to code initial configurations of gliders to depict any type of collision between the gliders and explore self-organization ofgliders, formation of larger tiles, and soliton-like interactions of glider and computable devices is proposed.

### Glider Collisions in Hybrid Cellular Automaton Rules

- Computer ScienceComplex Syst.
- 2015

This paper presents a discussion of the symbolic dynamics of the gliders in hybrid cellular automaton (HCA) rules�9 and 74 and three other HCA rules endowed with gliders and glider collisions are discussed.

### Designing Complex Dynamics in Cellular Automata with Memory

- Computer ScienceInt. J. Bifurc. Chaos
- 2013

A systematic analysis displays that memory helps "discover" hidden information and behavior on trivial — uniform, periodic, and nontrivial — chaotic, complex — dynamical systems.

### On the Dynamics of Cellular Automata with Memory

- Computer ScienceFundam. Informaticae
- 2015

It is shown that by enriching ECA with memory the authors can achieve transitions between the classes of behavioural complexity, and that memory helps to 'discover' hidden information and behaviour on trivial uniform, periodic, and non-trivial chaotic, complex dynamical systems.

### Solitons with a nested structure over finite fields

- Physics
- 2014

We propose a solitonic dynamical system over finite fields that may be regarded as an analogue of the box–ball systems. The one-soliton solutions of the system, which have nested structures similar…

### Simple Networks on Complex Cellular Automata: From de Bruijn Diagrams to Jump-Graphs

- Computer Science
- 2018

We overview networks which characterise dynamics in cellular automata. These networks are derived from one-dimensional cellular automaton rules and global states of the automaton evolution: de Bruijn…

### A Computation in a Cellular Automaton Collider Rule 110

- Computer ScienceArXiv
- 2016

This work shows how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations) and proposes constructions based on universality of elementary cellular automaton rule 110, cyclic tag systems, supercolliders, and computing on rings.

### On Creativity and Elementary Cellular Automata

- PsychologyComplex Syst.
- 2013

Cell-state transition rules of elementary cellular automata (ECAs) are mapped onto the phase space of cognitive control versus schizotypy and CA behavior is interpreted in terms of creativity. To…

## References

SHOWING 1-10 OF 92 REFERENCES

### Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules.

- PhysicsPhysical review. A, Atomic, molecular, and optical physics
- 1991

A detailed description of such ``reactions'' sheds new light on the large-time behavior of range-1 Rule 54 with a very slow decrease of the particle number, as ${\mathit{t}}^{\mathrm{\ensuremath{-}}\ensure Math{\gamma}}$ (Â£0.15).

### A Group Interpretation Of Particles Generated By One-Dimensional Cellular Automaton, Wolfram'S Rule 54

- Computer Science
- 2000

A group which allows the formal study of interactions between particles in one-dimensional cellular automata and using the new algebraic classification of Rapaport proves that rule 54 is not simple.

### Complex Dynamics of Elementary Cellular Automata Emerging from Chaotic Rules

- Computer ScienceInt. J. Bifurc. Chaos
- 2012

It is demonstrated that cell-state transition rules enriched with memory quickly transform a chaotic system converging to a complex global behavior from almost any initial condition.

### On conservative and monotone one-dimensional cellular automata and their particle representation

- MathematicsTheor. Comput. Sci.
- 2004

### Universality in Elementary Cellular Automata

- Computer ScienceComplex Syst.
- 2004

The purpose of this paper is to prove that one of the simplest one dimensional cellular automata is computationally universal, implying that many questions concerning its behavior, such as whether a…

### Defect particle kinematics in one-dimensional cellular automata

- MathematicsTheor. Comput. Sci.
- 2007

### A Nonlinear Dynamics Perspective of Wolfram's New Kind of Science Part IV: from Bernoulli Shift to 1/F Spectrum

- MathematicsInt. J. Bifurc. Chaos
- 2005

A complete characterization of the long-term time-asymptotic behaviors of all 256 one-dimensional CA rules are achieved via a single "probing" random input signal, and the graphs of the time-1 maps of the 256 CA rules represent, in some sense, the generalized Green's functions for Cellular Automata.