Dynamical properties of expansive one-sided cellular automata (Q1366859): Difference between revisions

This paper considers one-sided cellular automata and establishes dynamical properties when these cellular automata are expansive. A one-sided, one-dimensional cellular automaton (CA) is a map \(F:A^\mathbb{N}\to A^\mathbb{N}\) with \(F(X)_i= f(x_i,x_{i+1}, \dots, x_{i+n})\) where \(f\) is a given local map, \(A\) is a finite alphabet, \(\mathbb{N}\) is the set of positive integers and \(r\) is the neighborhood radius. To every one-sided, one-dimensional cellular automaton \(F\) with radius \(r\), there is an associated canonical factor defined by the first \(r\) coordinates of all the images of points under powers of \(F\). When the CA is surjective, this factor is a subshift which plays a fundamental role in the dynamics. The authors investigate positively expansive one-sided CA -- those that are conjugate to their canonical factors. They prove that the canonical factors of positively expansive, one-sided CA are mixing subshifts of finite type that are shift-equivalent to full-shifts. They also show that the uniform Bernoulli measure is the unique measure of maximal entropy for \(F\).