Related papers: Limit dynamics of elementary cellular automaton 18
We search for regularities in the sequences of numbers of preimages for elementary cellular automata. For 46 out of 88 "minimal" rules, we find recognizable patterns, usually in the form of second order recurrence equations with constant…
We perform an asymptotic analysis of general particle systems arising in collective behavior in the limit of large self-propulsion and friction forces. These asymptotics impose a fixed speed in the limit, and thus a reduction of the…
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…
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…
The confinement of elementary excitations induces distinctive features in the non-equilibrium quench dynamics. One of the most remarkable is the suppression of entanglement entropy which in several instances turns out to oscillate rather…
We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express…
In this paper, we study the numerical simulations for Euler system with maximal density constraint. This model is developed in [1, 3] with the constraint introduced into the system by a singular pressure law, which causes the transition of…
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…
We study the dynamics of discrete-time regulatory networks on random digraphs. For this we define ensembles of deterministic orbits of random regulatory networks, and introduce some statistical indicators related to the long-term dynamics…
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…
Systems evolving under the influence of competing two-body and three-body interactions, are of particular interest in exploring the stability of equilibrium states of strongly interacting many-body system. We present a solvable model based…
The cellular automata with local permutation invariance are considered. We show that in the two-state case the set of such automata coincides with the generalized Game of Life family. We count the number of equivalence classes of the rules…
The minimal number of inputs in the local function of a non-trivial cellular automaton is two. Such a function can be viewed as as a kind of binary operation. If this operation is associative, it forms, together with the set of states, a…
A mathematical model for a two-gene regulatory network is derived and several of their properties analyzed. Due to the presence of mixed continuous/discrete dynamics and hysteresis, we employ a hybrid systems model to capture the dynamics…
Molecular dynamic simulations are performed to investigate a long-time evolution of different type initial signals in nonlinear acoustic chains with realistic Exp-6 potential and with power ones. Finite number of long-lifetime kink-shaped…
This paper concerns $\mu$-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial $\mu$-random configuration. More precisely, we investigate the…
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of the central cell will follow a given evolution, by…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…