Related papers: Right-Permutative Cellular Automata on Topological…
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov…
We introduce a new class of probabilistic cellular automata that are capable of exhibiting rich dynamics such as synchronization and ergodicity and can be easily inferred from data. The system is a finite-state locally interacting Markov…
We revisit the problem of finding the conditions under which synchronous probabilistic cellular automata indexed by the line $\mathbb{Z}$, or the periodic line $\cyl{n}$, depending on 2 neighbours, admit as invariant distribution the law of…
Cellular automata represent physical systems where both space and time are discrete, and the associated physical quantities assume a limited set of values. While previous research has applied cellular automata in modeling chemical,…
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…
In this paper we study the measure-theoretical entropy of the one-dimensional linear cellular automata (CA hereafter) $T_{f[-l,r]}$, generated by local rule $f(x_{-l},...,x_{r})= \sum\limits_{i=-l}^{r}\lambda_{i}x_{i}(\text{mod}\ m)$, where…
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity,…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
This paper investigates the $k$-mixing property of a multidimensional cellular automaton. Suppose $F$ is a cellular automaton with the local rule $f$ defined on a $d$-dimensional convex hull $\mathcal{C}$ which is generated by an apex set…
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,…
We explore some aspects of phase transitions in cellular automata. We start recalling the standard formulation of statistical mechanics of discrete systems (Ising model), illustrating the Monte Carlo approach as Markov chains and stochastic…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be…
We investigate topological and ergodic properties of cellular automata having equicontinuity points. In this class surjectivity on a transitive SFT implies existence of a dense set of periodic points. Our main result is that under the…
For the action of an algebraic cellular automaton on a Markov subgroup, we show that the Ces\`{a}ro mean of the iterates of a Markov measure converges to the Haar measure. This is proven by using the combinatorics of the binomial…
We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…
Let us consider the simplest model of one-dimensional probabilistic cellular automata (PCA). The cells are indexed by the integers, the alphabet is {0, 1}, and all the cells evolve synchronously. The new content of a cell is randomly…
We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb F}_p^{\mathbb Z} \to {\mathbb F}_p^{\mathbb Z}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions which…
Consider a finite Abelian group (G,+), with |G|=p^r, p a prime number, and F: G^N -> G^N the cellular automaton given by {F(x)}_n= A x_n + B x_{n+1} for any n in N, where A and B are integers relatively primes to p. We prove that if P is a…
In this paper we initiate the study of cellular automata on racks. A rack $R$ is a set with a self-distributive binary operation. The rack $R$ acts on the set $A^R$ of configurations from $R$ to a set $A$. We define the cellular automaton…