The complexity of permutive cellular automata
zbMATH Open1238.34034MaRDI QIDQ2888063FDOQ2888063
Authors: Jung-Chao Ban, Chih-Hung Chang, Ting-Ju Chen, Mei-Shao Lin
Publication date: 30 May 2012
Published in: Journal of Cellular Automata (Search for Journal in Brave)
Recommendations
chaosequilibrium measuresnap-back repellerpermutive cellular automataphase transition, Parry measure
Nonlinear boundary value problems for ordinary differential equations (34B15) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Stability of topological dynamical systems (37B25) Topological entropy (37B40)
Cited In (11)
- Prevalence of odometers in cellular automata
- Statistical mechanics of surjective cellular automata
- An algorithm for testing permutativeness of cellular automata
- Some properties of topological pressure on cellular automata
- A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
- Prevalence and structure of adding machines for cellular automata
- Title not available (Why is that?)
- Permutation cellular automata
- On the dynamics of cellular automata induced from a prefix code
- The measure-theoretic entropy and topological entropy of actions over \(\mathbb{Z}_m\)
- Commutators of bipermutive and affine cellular automata
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)