Related papers: Linear cellular automata, asymptotic randomization…
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…
Fuzzy cellular automaton is a dynamical system with a continuous state value embedding a cellular automaton with a discrete state value. We investigate a fuzzy cellular automaton obtained from an elementary cellular automaton of rule number…
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
We present a probabilistic cellular automaton (CA) with two absorbing states which performs classification of binary strings in a non-deterministic sense. In a system evolving under this CA rule, empty sites become occupied with a…
Revisiting the notion of m-almost equicontinuous cellular automata introduced by R. Gilman, we show that the sequence of image measures of a shift ergodic measure m by iterations of a m-almost equicontinuous automata F, converges in Cesaro…
We show that a cellular automaton (or shift-endomorphism) on a transitive subshift is either almost equicontinuous or sensitive. On the other hand, we construct a cellular automaton on a full-shift (hence a transitive subshift) that is…
We show that a sequence over a finite field $\mathbb F_q$ of characteristic $p$ is $p$-automatic if and only if it occurs as a column of the spacetime diagram, with eventually periodic initial conditions, of a linear cellular automaton with…
Let L:= Z^D be the D-dimensional lattice and let A^L be the Cantor space of L-indexed configurations in some finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F of A^L,…
If L=Z^D and A is a finite set, then A^L is a compact space. A cellular automaton (CA) is a continuous transformation F:A^L--> A^L that commutes with all shift maps. A quasisturmian (QS) subshift is a shift-invariant subset obtained by…
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…
We consider a nonlinear model for electrical conduction in biological tissues. The nonlinearity appears in the interface condition prescribed on the cell membrane. The purpose of this paper is proving asymptotic convergence for large times…
Defining the density flow of perturbations moving at a given speed for cellular automata, we establish equalities and inequalities between the measurable entropy of a cellular automaton and the measurable entropy of its associated shift.
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…
We study the most elementary family of cellular automata defined over an arbitrary group universe $G$ and an alphabet $A$: the lazy cellular automata, which act as the identity on configurations in $A^G$, except when they read a unique…
Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the…
We apply a recently proposed dynamically driven renormalization group scheme to probabilistic cellular automata having one absorbing state. We have found just one unstable fixed point with one relevant direction. In the limit of small…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
In this paper we study in complete generality the family of two-state, deterministic, monotone, local, homogeneous cellular automata in $\mathbb{Z}^d$ with random initial configurations. Formally, we are given a set…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…