A divide and conquer algorithm for deciding group cellular automata dynamics
From MaRDI portal
Cites work
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- A secret sharing scheme based on cellular automata
- An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption
- An efficiently computable characterization of stability and instability for linear cellular automata
- Attractors of linear cellular automata
- Automorphisms of compact groups
- Cellular automata and groups
- Cellular Automata: Analysis and Applications
- Chaos for endomorphisms of completely metrizable groups and linear operators on Fréchet spaces
- Color blind cellular automata
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Dynamical behavior of additive cellular automata over finite abelian groups
- Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata
- Endomorphisms and automorphisms of the shift dynamical system
- Ergodic theory on compact spaces
- Ergodic theory. Introductory lectures
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- Every compact metric space that supports a positively expansive homeomorphism is finite
- Homogeneity of surjective cellular automata
- scientific article; zbMATH DE number 6069823 (Why is no real title available?)
- scientific article; zbMATH DE number 2184880 (Why is no real title available?)
- scientific article; zbMATH DE number 4074492 (Why is no real title available?)
- scientific article; zbMATH DE number 44378 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 1500511 (Why is no real title available?)
- scientific article; zbMATH DE number 918596 (Why is no real title available?)
- Languages, equicontinuity and attractors in cellular automata
- Lyapunov exponent versus expansivity and sensitivity in cellular automata
- METRIC PROPERTIES OF ENDOMORPHISMS ON HOMOGENEOUS SPACES OF COMPACT GROUPS
- On computing the entropy of cellular automata.
- On Expansive Transformation Groups
- On shift spaces with algebraic structure
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- On the Limit Sets of Cellular Automata
- Open mapping theorem for topological groups
- Periodic points for onto cellular automata
- Rice's theorem for the limit sets of cellular automata
- Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata
- Some results on affine transformations of compact groups
- Textile systems for endomorphisms and automorphisms of the shift
- The topological entropy of cellular automata is uncomputable
- Topological Entropy
- Topological entropy in totally disconnected locally compact groups
This page was built for publication: A divide and conquer algorithm for deciding group cellular automata dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859739)
