The complexity of permutive cellular automata
From MaRDI portal
Publication:2888063
Recommendations
Cited in
(11)- Commutators of bipermutive and affine cellular automata
- A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
- scientific article; zbMATH DE number 17562 (Why is no real title available?)
- The measure-theoretic entropy and topological entropy of actions over \(\mathbb{Z}_m\)
- Statistical mechanics of surjective cellular automata
- Permutation cellular automata
- Prevalence of odometers in cellular automata
- Prevalence and structure of adding machines for cellular automata
- An algorithm for testing permutativeness of cellular automata
- Some properties of topological pressure on cellular automata
- On the dynamics of cellular automata induced from a prefix code
This page was built for publication: The complexity of permutive cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888063)