Related papers: Complex dynamics emerging in Rule 30 with majority…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
The essential ingredient for studying the phenomena of emergence is the ability to generate and manipulate emergent systems that span large scales. Cellular automata are the model class particularly known for their effective scalability but…
We construct a cellular automaton (CA) model that describes the movement of a particle in a disordered system. The mathematical properties of the CA model were examined by varying the configuration of grid and determining the number of…
Enhancing robot navigation efficiency is a crucial objective in modern robotics. Robots relying on external navigation systems are often susceptible to electromagnetic interference (EMI) and encounter environmental disturbances, resulting…
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…
We study transformations of 2-, 4- and 6-bit numbers in interactions between traveling and stationary localizations in the Spiral Rule reaction-diffusion cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state…
A simple relation of the order of $n$ abstract objects generates an $n-2$ dimensional basis of three dimensional vectors. A cellular automaton-like model of evolution of this system is postulated. During this evolution, some quantities…
The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generators of the mobile patterns, glider guns, in its evolution. We…
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…
Factorized dynamics in soliton cellular automata with quantum group symmetry is identified with a motion of particles and anti-particles exhibiting pair creation and annihilation. An embedding scheme is presented showing that the…
We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties…
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like…
In this paper I describe a cellular automaton model of a multi-species ecosystem, suitable for the study of emergent properties of macroevolution. Unlike majority of ecological models, the number of coexisting species is not fixed. Starting…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
The local rules of Wolfram cellular automata with one-dimensional three-cell neighborhoods are represented by eight-bit binary that encode deterministic update rules. These automata are widely utilized to investigate self-organization…
The spatial structure, fluctuations as well as all state probabilities of self-organized (steady) states of cellular automata can be found (almost) exactly and {\em explicitly} from their Markovian dynamics. The method is shown on an…
We consider a probabilistic cellular automaton to analyze the stochastic dynamics of a predator-prey system. The local rules are Markovian and are based in the Lotka-Volterra model. The individuals of each species reside on the sites of a…
Cellular automata are synchronous discrete dynamical systems used to describe complex dynamic behaviors. The dynamic is based on local interactions between the components, these are defined by a finite graph with an initial node coloring…
Central to the artificial life endeavour is the creation of artificial systems spontaneously generating properties found in the living world such as autopoiesis, self-replication, evolution and open-endedness. While numerous models and…