Related papers: Introducing Lyapunov profiles of cellular automata
We study non-equilibrium defect accumulation dynamics on a cellular automaton trajectory: a branching walk process in which a defect creates a successor on any neighborhood site whose update it affects. On an infinite lattice, defects…
We study the synchronization of totalistic one dimensional cellular automata (CA). The CA with a non zero synchronization threshold exhibit complex non periodic space time patterns and conversely. This synchronization transition is related…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
Using the concept of the Boolean derivative we study damage spreading for one dimensional elementary cellular automata and define their maximal Lyapunov exponent. A random matrix approximation describes quite well the behavior of…
An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes,…
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…
Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of…
The control of chaotic systems implies inducing an unpredictable system to follow a desired trajectory using the smallest "force". In low-dimensional continuous systems, one method is that of reconstructing the tangent space, so that the…
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on 2D CA and aims at showing that the situation is different and more…
Continuous cellular automata (CCAs) have evolved from discrete lookup tables to continuous partial differential equation (PDE) formulations in the search for novel forms of complexity. Despite innovations in qualitative behavior, analytical…
We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be…
We consider the problem of computing the Lyapunov exponents of reversible cellular automata (CA). We show that the class of reversible CA with right Lyapunov exponent $2$ cannot be separated algorithmically from the class of reversible CA…
In this paper we consider the identification problem of Cellular Automata (CAs). The problem is defined and solved in the context of partial observations with time gaps of unknown length, i.e. pre-recorded, partial configurations of the…
Throughout the literature on Neural Cellular Automata (NCAs), it is often taken for granted that the systems learn attractors. This is shown through evolving the system for many timesteps and noting visual similarity to the goal state.…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
This study focuses on an extended model of a standard cellular automaton (CA) that includes an extra index consisting of a radius that defines a perception area for each cell in addition to the radius defined by the CA rule. Extended…
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…
Step size in continuous cellular automata (CA) plays an important role in the stability and behavior of self-organizing patterns. Continous CA dynamics are defined by formula very similar to numerical estimation of physics-based ordinary…
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…
Space-time directional Lyapunov exponents are introduced. They describe the maximal velocity of propagation to the right or to the left of fronts of perturbations in a frame moving with a given velocity. The continuity of these exponents as…