About a low complexity class of cellular automata
From MaRDI portal
Publication:950136
Abstract: Extending to all probability measures the notion of m-equicontinuous cellular automata introduced for Bernoulli measures by Gilman, we show that the entropy is null if m is an invariant measure and that the sequence of image measures of a shift ergodic measure by iterations of such automata converges in Cesaro mean to an invariant measure mc. Moreover this cellular automaton is still mc-equicontinuous and the set of periodic points is dense in the topological support of the measure mc. The last property is also true when m is invariant and shift ergodic.
Recommendations
- Limit behaviour of -equicontinuous cellular automata
- Density of periodic points, invariant measures and almost equicontinuous points of cellular automata
- Some properties of cellular automata with equicontinuity points
- On the measure entropy of additive cellular automata \(f_\infty\)
- Limit measures for affine cellular automata
Cites work
- scientific article; zbMATH DE number 4092780 (Why is no real title available?)
- Cellular automata and Lyapunov exponents
- Classes of linear automata
- Density of periodic points, invariant measures and almost equicontinuous points of cellular automata
- Some properties of cellular automata with equicontinuity points
Cited in
(6)- Rigidity results in cellular automata theory: probabilistic and ergodic theory approach
- Some properties of cellular automata with equicontinuity points
- Limit averages of continuous functions under the action of cellular automata
- The quadratic eigenvalue problem in electric power systems
- Stationary measures for automaton rules 90 and 150
- Density of periodic points, invariant measures and almost equicontinuous points of cellular automata
This page was built for publication: About a low complexity class of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950136)