Related papers: Mean equicontinuity and mean sensitivity on cellul…
In this work, we investigate the dynamics of a general non-autonomous system generated by a commutative family of homeomorphisms. In particular, we investigate properties such as periodicity, equicontinuity, minimality and transitivity for…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on an operation of rescaling is receiving more and more…
We study metal-insulator transitions between Mott insulators and metals. The transition mechanism completely different from the original dynamical mean field theory (DMFT) emerges from a cluster extension of it. A consistent picture…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
We define weaker forms of topological and measure theoretical equicontinuity for topological dynamical systems and we study their relationships with systems with discrete spectrum and zero sequence entropy. In the topological category we…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…
We analyze a stochastic 5-neighbor cellular automaton with several conserved quantities, including the particle density. By examining the eigenvalue problem of the associated transition matrix, we derive an explicit formula for the…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
Let $S$ be a cancellative left-amenable semigroup and let $A$ be a finite set. We prove that every pre-injective cellular automaton $\tau \colon A^S \to A^S$ is surjective.
Let M=Z^D be a D-dimensional lattice, and let A be an abelian group. A^M is then a compact abelian group; a `linear cellular automaton' (LCA) is a topological group endomorphism \Phi:A^M --> A^M that commutes with all shift maps. Suppose…
We define the notion of stochastic stability, already present in the literature in the context of smooth dynamical systems, for invariant measures of cellular automata perturbed by a random noise, and the notion of strongly stochastically…
In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to "largeness". The first property is ID…
We show that an almost expansive cellular automaton according to Gilman's classification cannot have irrational eigenvalues. This completes the proof that any surjective cellular automaton cannot have irrational eigenvalues for the uniform…
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…
The aim of this article is to obtain a better understanding and classification of strictly ergodic topological dynamical systems with discrete spectrum. To that end, we first determine when an isomorphic maximal equicontinuous factor map of…
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…
Cellular automata with memory (CAM) are widely used in fields such as image processing, pattern recognition, simulation, and cryptography. The invertibility of CAM is generally considered to be chaotic. Paper [Invertible behavior in…
We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…