Related papers: Some Ergodic Properties of Invertible Cellular Aut…
For an arbitrary group $G$ and arbitrary set $A$, we define a monoid structure on the set of all uniformly continuous functions $A^G\to A$ and then we show that it is naturally isomorphic to the monoid of cellular automata $\mathrm{CA}(G,…
Let $(\az,F)$ be a bipermutative algebraic cellular automaton. We present conditions which force a probability measure which is invariant for the $\N\times\Z$-action of $F$ and the shift map $\s$ to be the Haar measure on $\gs$, a closed…
The positive rates conjecture states that a one-dimensional probabilistic cellular automaton (PCA) with strictly positive transition rates must be ergodic. The conjecture has been refuted by G\'acs, whose counterexample is a cellular…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
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 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…
We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition…
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. First of all, an easily checkable characterization of positive expansivity is provided for the non…
We propose using Probabilistic Cellular Automata (PCA) to address inverse problems with the Bayesian approach. In particular, we use PCA to sample from an approximation of the posterior distribution. The peculiar feature of PCA is their…
Consider the cellular automata (CA) of $\mathbb{Z}^{2}$-action $\Phi$ on the space of all doubly infinite sequences with values in a finite set $\mathbb{Z}_{r}$, $r \geq 2$ determined by cellular automata $T_{F[-k, k]}$ with an additive…
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via…
We propose a correspondence between certain multiband linear cellular automata - models of computation widely used in the description of physical phenomena - and endomorphisms of certain algebraic unipotent groups over finite fields. The…
Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
Our previous work dealt with the zeta function for the interacting particle system (IPS) including quantum cellular automaton (QCA) as a typical model in the study of ``IPS/Zeta Correspondence". On the other hand, the absolute zeta function…
Let $f$ be a polynomial automorphism of ${\Bbb C}^k$ of degree $\lambda$, whose rational extension to ${\Bbb P}^k$ maps the hyperplane at infinity to a single point. Given any positive closed current $S$ on ${\Bbb P}^k$ of bidegree (1,1),…
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…
Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…
Cellular Automata (CA) theory is a discrete model that represents the state of each of its cells from a finite set of possible values which evolve in time according to a pre-defined set of transition rules. CA have been applied to a number…
Classical cellular automata represent a class of explicit discrete spacetime lattice models in which complex large-scale phenomena emerge from simple deterministic rules. With the goal to uncover different physically distinct classes of…