Related papers: Some properties of cellular automata with equicont…
We define a class of dynamical maps on the quasi-local algebra of a quantum spin system, which are quantum analogues of probabilistic cellular automata. We develop criteria for such a system to be ergodic, i.e., to possess a unique…
We study limit sets of stable cellular automata standing from a symbolic dynamics point of view where they are a special case of sofic shifts admitting a steady epimorphism. We prove that there exists a right-closing almost-everywhere…
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…
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…
In this paper we consider cellular automata $(\mathfrak{G},\Phi)$ with algebraic local rules and such that $\mathfrak{G}$ is a topological Markov chain which has a structure compatible to this local rule. We characterize such cellular…
We consider the range of possible dynamics of cellular automata (CA) on two-sided beta-shifts $S_\beta$. We show that any reversible CA $F:S_\beta\to S_\beta$ has an almost equicontinuous direction whenever $S_\beta$ is not sofic. This has…
We study some dynamical properties of a family of two-dimensional cellular automata: those that arise from an underlying one dimensional sand automaton whose local rule is obtained using a latin square. We identify a simple sand automaton G…
In this article, we pay attention to transitive dynamical systems having the shadowing property and the entropy functions are upper semicontinuous. As for these dynamical systems, when we consider ergodic optimization restricted on the…
We show that an $R^d$-topological dynamical system equipped with an invariant ergodic measure has discrete spectrum if and only it is $\mu$-mean equicontinuous (proven for $Z^d$ before). In order to do this we introduce mean equicontinuity…
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…
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 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…
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…
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,…
In this paper, we perform a theoretical analysis of the sequential convergence of elementary cellular automata that have at least one fixed point. Our aim is to establish which elementary rules always reach fixed points under sequential…
We discuss various properties of Probabilistic Cellular Automata, such as the structure of the set of stationary measures and multiplicity of stationary measures (or phase transition) for reversible models.
We construct a one-dimensional uniquely ergodic cellular automaton which is not nilpotent. This automaton can perform asymptotically infinitely sparse computation, which nevertheless never disappears completely. The construction builds on…
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like…
The asymptotic behavior of a cellular automaton iterated on a random configuration is well described by its limit probability measure(s). In this paper, we characterize measures and sets of measures that can be reached as limit points after…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…