Related papers: Exact solution of the Rule 150 reversible cellular…
Rule 22 elementary cellular automaton (ECA) has a 3--cell neighborhood, binary cell states, where a cell takes state `1' if there is exactly one neighbor, including the cell itself, in state `1'. In Boolean terms the cell-state transition…
Agent-based (AB) or Cellular Automata (CA) models are rule based and are a relatively simple discrete method that can be used to simulate complex interactions of many agents or cells. The relative ease of implementing the computational…
We propose and discuss two variants of kinetic particle models - cellular automata in 1+1 dimensions, which have some appeal due to their simplicity and intriguing properties which could warrant further research and applications. The first…
Reversibility of a one-dimensional finite cellular automaton (CA) is dependent on lattice size. A finite CA can be reversible for a set of lattice sizes. On the other hand, reversibility of an infinite CA, which is decided by exploring the…
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…
We study a two-dimensional cellular automaton (CA), called Diffusion Rule (DR), which exhibits diffusion-like dynamics of propagating patterns. In computational experiments we discover a wide range of mobile and stationary localizations…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
Three cellular automaton (CA) models of increasing complexity are introduced to model driven diffusive systems related to the generalized Frenkel-Kontorova (FK) models recently proposed by Braun [Phys.Rev.E58, 1311 (1998)]. The models are…
Elementary cellular automata (ECA) is a widely studied one-dimensional processing methodology where the successive iteration of the automaton may lead to the recreation of a rich pattern dynamic. Recently, cellular automata have been…
The dynamics group of an asynchronous cellular automaton (ACA) relates properties of its long term dynamics to the structure of Coxeter groups. The key mathematical feature connecting these diverse fields is involutions. Group-theoretic…
Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction…
The property of reversibility is quite meaningful for the classic theoretical computer science model, cellular automata. For the reversibility problem for a CA under null boundary conditions, while linear rules have been studied a lot, the…
We study a quantum cellular automaton (QCA) whose time-evolution is defined from global transition function of classical cellular automata (CA). In order to investigate natural transformations from CA to QCA, the present QCA includes CA…
We review recent results on an exactly solvable model of nonequilibrium statistical mechanics, specifically the classical Rule 54 reversible cellular automaton and some of its quantum extensions. We discuss the exact microscopic description…
Individual cellular automata rules are attractive models for a range of biological and physical self-assembling systems. While coexpression and coevolution are common in such systems, ensembles of cellular automata rules remain poorly…
Cellular automata generate spatially extended, temporally persistent emergent structures from local update rules. No general method derives the mechanisms of that generation from the rule itself; existing tools reconstruct structure from…
Finite cellular automata (FCA) are widely used in simulating nonlinear complex systems, and their reversibility is closely related to information loss during the evolution. However, only a relatively small portion of their reversibility…
For an interacting spatio-temporal lattice system we introduce a formal way of expressing multi-time correlation functions of local observables located at the same spatial point with a time state, i.e. a statistical distribution of…
Classical reversible cellular automata (CAs), which describe the discrete-time dynamics of classical degrees of freedom in a finite state-space, can exhibit exact, nonthermal quantum eigenstates despite being classically chaotic. We show…
While the reversibility of multidimensional cellular automata is undecidable and there exists a criterion for determining if a multidimensional linear cellular automaton is reversible, there are only a few results about the reversibility…