Related papers: Rescaled entropy of cellular automata
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.
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
We consider the continuum limit of some products of random matrices in $\text{SL}(d,{\mathbb R})$ that arise as discretisations of incompressible renewing flows -- that is, of flows corresponding to a divergence-free velocity field that…
We give new sufficient ergodicity conditions for two-state probabilistic cellular automata (PCA) of any dimension and any radius. The proof of this result is based on an extended version of the duality concept. Under these assumptions, in…
An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes,…
We present an analytical-numerical method providing robust upper estimates for the topological entropy or, more generally, uniform volume growth exponents of differentiable mappings. By introducing varying metrics, we simplify the analysis…
In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or set of symbol sequences produced by the system. There are well-established classification schemes, such as the Chomsky hierarchy,…
For an expansive homeomorphism, we investigate the relationship among dimension, entropy, and Lyapunov exponents. Motivated by Young's formula for surface diffeomorphisms, which links dimension and measure-theoretic entropy with hyperbolic…
This paper presents an application of the Infinite Unit Axiom, introduced by Yaroslav Sergeyev, (see [11] - [14]) to the development of one-dimensional cellular automata. This application allows the establishment of a new and more precise…
Fekete's lemma is a well known combinatorial result on number sequences: we extend it to functions defined on $d$-tuples of integers. As an application of the new variant, we show that nonsurjective $d$-dimensional cellular automata are…
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…
We investigate the predictability problem in dynamical systems with many degrees of freedom and a wide spectrum of temporal scales. In particular, we study the case of $3D$ turbulence at high Reynolds numbers by introducing a finite-size…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
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 introduce the notion of rescaled expansive measures to study a measure-theoretic formulation of rescaled expansiveness for flows, particularly in the presence of singularities. Equivalent definitions are established via…
For a non-generic, yet dense subset of $C^1$ expanding Markov maps of the interval we prove the existence of uncountably many Lyapunov optimizing measures which are ergodic, fully supported and have positive entropy. These measures are…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
Cellular automata (CA) have long attracted attention as dynamical systems with local updating rules and yet can exhibit, for certain rules, complex, long space and time correlated patterns. This contrast with other rules which results in…
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…