Related papers: Gliders and Ether in Rule 54
Flexible Time is a new formalism for calculations about one-dimensional cellular automata. It unifies the states of a finite number of cells into a single object, even if they occur at different times. This gives greater flexibility to…
Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rule-90 and 150. The time evolutions are described with matrices. Eigenvalue analysis is applied to clarify the…
The dynamics of rule 54 one-dimensional two-state cellular automaton (CA) are a discrete analog of a space-time dynamics of excitations in nonlinear active medium with mutual inhibition. A cell switches its state 0 to state 1 if one of its…
Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular-automaton analogous of localizations or…
In cellular automata with memory, the unchanged maps of the conventional cellular automata are applied to cells endowed with memory of their past states in some specified interval. We implement Rule 30 automata with a majority memory and…
Here I describe a view of the evolution of cellular automata that allows to operate on larger structures. Instead of calculating the next state of all cells in one step, the method here developed uses a time slice that can proceed at…
The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic…
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system --- when enriched with memory -- hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced…
Classical cellular automata represent a class of explicit discrete spacetime lattice models in which complex large-scale phenomena emerge from simple deterministic rules. With the goal to uncover different physically distinct classes of…
Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of…
In this paper we study the space evolution in the Rule 54 reversible cellular automaton, which is a paradigmatic example of a deterministic interacting lattice gas. We show that the spatial translation of time configurations of the…
Periodicity and relaxation are investigated for the trajectories of the states in cylindrical linear cellular automata. The time evolutions are described with matrices. The eigenvalue analysis is applied to obtain the maximum values of…
Cellular automata (CA) are well-studied models of decentralized parallel computation, known for their ability to exhibit complex global behavior from simple local rules. While their dynamics have been widely explored through simulations, a…
Cellular automata have recently attracted a lot of attention as testbeds to explore the emergence of many-body quantum chaos and hydrodynamics. We consider the Rule 54 model, one of the simplest interacting integrable models featuring two…
The total activity of the single-seeded cellular rule 150 automaton does not follow a one-step iteration like other elementary cellular automata, but can be solved as a two-step vectorial, or string, iteration, which can be viewed as a…
The mechanics of crawling cells on a substrate is investigated by using a minimal model that satisfies the force-free condition. A cell is described by two subcellular elements connected by a linear actuator that changes the length of the…
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…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
The Stranded Cellular Automata (SCA) model consists of a grid of cells which can each contain between zero and two strands apiece and two turning rules that control when strands turn and when they cross. While patterns on this model have…
We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order…