Related papers: Limit sets of stable Cellular Automata
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular…
In this paper, we propose a stochastic cellular automaton model of traffic flow extending two exactly solvable stochastic models, i.e., the asymmetric simple exclusion process and the zero range process. Moreover it is regarded as a…
Caputo fractional (with power-law kernels) and fractional (delta) difference maps belong to a more widely defined class of generalized fractional maps, which are discrete convolutions with some power-law-like functions. The conditions of…
The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules…
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift-commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the…
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
The term integrable asymptotically conformal at a point for a quasiconformal map defined on a domain is defined. Furthermore, we prove that there is a normal form for this kind attracting or repelling or super-attracting fixed point with…
We investigate critical properties of a class of number-conserving cellular automata (CA) which can be interpreted as deterministic models of traffic flow with anticipatory driving. These rules are among the only known CA rules for which…
This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many…
We consider discrete-time random perturbations of monotone cellular automata (CA) in two dimensions. Under general conditions, we prove the existence of half-space velocities, and then establish the validity of the Wulff construction for…
Controllability is one of the central concepts of modern control theory that allows a good understanding of a system's behaviour. It consists in constraining a system to reach the desired state from an initial state within a given time…
In Isliker et al. (2000b), an extended cellular automaton (X-CA) model for solar flares was introduced. In this model, the interpretation of the model's grid-variable is specified, and the magnetic field, the current, and an approximation…
Given a finite set $A$ and a group homomorphism $\phi : H \to G$, a $\phi$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $\phi$-equivariant in the sense that…
Let M be a monoid (e.g. the lattice Z^D), and A an abelian group. A^M is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. Let mu be a (possibly…
For a finite group $G$ and a finite set $A$, we study various algebraic aspects of cellular automata over the configuration space $A^G$. In this situation, the set $\text{CA}(G;A)$ of all cellular automata over $A^G$ is a finite monoid…
Many graph algorithms can be viewed as sets of rules that are iteratively applied, with the number of iterations dependent on the size and complexity of the input graph. Existing machine learning architectures often struggle to represent…
For any group $G$ and set $A$, a cellular automaton over $G$ and $A$ is a transformation $\tau : A^G \to A^G$ defined via a finite neighborhood $S \subseteq G$ (called a memory set of $\tau$) and a local function $\mu : A^S \to A$. In this…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…
Exactly ergodicity in boundary-driven semi-infinite cellular automata (CA) are investigated. We establish all the ergodic rules in CA with 3, 4, and 5 states. We analytically prove the ergodicity for 12 rules in 3-state CA and 118320 rules…