Related papers: Linear cellular automata, asymptotic randomization…
We exhibit a Probabilistic Cellular Automaton (PCA) on the integers with an alphabet and a neighborhood of size 2 which is non-ergodic although it has a unique invariant measure. This answers by the negative an old open question on whether…
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…
Given a finite family F of linear forms with integer coefficients, and a compact abelian group G, an F-free set in G is a measurable set which does not contain solutions to any equation L(x)=0 for L in F. We denote by d_F(G) the supremum of…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
We consider a left permutive cellular automaton Phi, with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there…
In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality $p^k$, i.e. the maps $T_{f[l,r]}:\mathbb{Z}^{\mathbb{Z}}_{p^k}\to\mathbb{Z}^{\mathbb{Z}}_{p^k}$ which…
This paper explores the algebraic conditions under which a cellular automaton with a non-linear local rule exhibits surjectivity and reversibility. We also analyze the role of permutivity as a key factor influencing these properties and…
In this article we give a new definition of some analog of Lyapunov exponents for cellular automata . Then for a shift ergodic and cellular automaton invariant probability measure we establish an inequality between the entropy of the…
Let $G$ be a group and let $X$ be an algebraic variety over an algebraically closed field $k$ of characteristic zero. Denote $A=X(k)$ the set of rational points of $X$. We investigate invertible algebraic cellular automata $\tau \colon A^G…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
A recently introduced model of coupled non linear oscillators in a ring is revisited in terms of its information processing capabilities. The use of Lempel-Ziv based entropic measures allows to study thoroughly the complex patterns…
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…
Let $A$ be a random subset of $\mathbb{Z}_{N}$ obtained by including each element of $\mathbb{Z}_{N}$ in $A$ independently with probability $p$. We say that $A$ is \emph{linear} if the only Freiman homomorphisms are given by the…
We present a class of random cellular automata with multiple invariant measures which are all non-Gibbsian. The automata have configuration space {0,1}^{Z^d}, with d > 1, and they are noisy versions of automata with the "eroder property".…
The problem of linear modulation classification using likelihood based methods is considered. Asymptotic properties of most commonly used classifiers in the literature are derived. These classifiers are based on hybrid likelihood ratio test…
We study the generic limit sets of one-dimensional cellular automata, which intuitively capture their asymptotic dynamics while discarding transient phenomena. As our main results, we characterize the automata whose generic limit set is a…
We prove that every probabilistic cellular automaton with strictly positive transition probabilities that admits a stationary Bernoulli measure is exponentially ergodic. Moreover, the mixing time of any finite region in such a system is…
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but…
We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic…
Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular…