Linear cellular automata over \(Z_ m\)
From MaRDI portal
Publication:1059397
DOI10.1016/0022-0000(83)90033-8zbMath0566.68047OpenAlexW2002600082MaRDI QIDQ1059397
Masakazu Nasu, Nobuyasu Ôsato, Masanobu Itô
Publication date: 1983
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(83)90033-8
Related Items (52)
Group structured linear cellular automata over \(Z_ m\) ⋮ Solution of some conjectures about topological properties of linear cellular automata ⋮ On ergodic linear cellular automata over Zm ⋮ Dynamical characteristics of linear cellular automata ⋮ UPPER BOUND OF THE DIRECTIONAL ENTROPY OF A ℤ2-ACTION ⋮ On cellular automata over Galois rings ⋮ Directional Metric Entropy and Lyapunov Exponents for Dynamical Systems Generated by Cellular Automata ⋮ Additive cellular automata and global injectivity ⋮ A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m ⋮ Ternary reversible number-conserving cellular automata are trivial ⋮ On the Bernoulli automorphism of reversible linear cellular automata ⋮ Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) ⋮ Reversibility problem of multidimensional finite cellular automata ⋮ Surjective linear cellular automata over \({\mathbb{Z}}_{m}\) ⋮ Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\) ⋮ Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption ⋮ On the sensitivity of additive cellular automata in Besicovitch topologies ⋮ Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ On computing the entropy of cellular automata. ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption ⋮ Unnamed Item ⋮ On the dynamical behaviour of linear higher-order cellular automata and its decidability ⋮ A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\) ⋮ Inversion of circulant matrices over $\mathbf{Z}_m$ ⋮ A family of sand automata ⋮ An efficiently computable characterization of stability and instability for linear cellular automata ⋮ The structure of reversible one-dimensional cellular automata ⋮ Self-similarity of linear cellular automata ⋮ On characterization of cellular automata with matrix algebra ⋮ AN UPPER BOUND OF THE DIRECTIONAL ENTROPY WITH RESPECT TO THE MARKOV MEASURES ⋮ Continuity of information transport in surjective cellular automata ⋮ Large semigroups of cellular automata ⋮ Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions ⋮ Reversibility of linear cellular automata on Cayley trees with periodic boundary condition ⋮ The topological entropy of invertible cellular automata ⋮ Dynamical behavior of additive cellular automata over finite abelian groups ⋮ Linear cellular automata on Cayley graphs ⋮ Theory of cellular automata: a survey ⋮ On the topological directional entropy ⋮ Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects ⋮ Pre-expansivity in cellular automata ⋮ Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties ⋮ Ergodic characterization of linear cellular automata over \(Z_{m}\) ⋮ Reversibility of non-saturated linear cellular automata on finite triangular grids ⋮ On the directional dynamics of additive cellular automata ⋮ Reversibility of number-conserving 1D cellular automata: unlocking insights into the dynamics for larger state sets ⋮ Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\) ⋮ Recurrent Misconceptions in the Study of CA Reversibility on Triangular Grids ⋮ Attractors of linear cellular automata ⋮ Decidability and undecidability in cellular automata ⋮ Replication of spatial patterns with reversible and additive cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An interconnection of local maps inducing onto global maps
- Growth patterns of ordered cellular automata
- Strong surjectivity is equivalent to C-injectivity
- Reproduction in tessellation structures
- Another proof of the theorem on pattern reproduction in tessellation structures
- Certain relations between properties of maps of tessellation automata
- A note on pattern reproduction in tessellation structures
- On convergence of configurations
- Injectivity and surjectivity of parallel maps for cellular automata
- Tessellation structures for reproduction of arbitrary patterns
- Pattern reproduction in tessellation automata of arbitrary dimension
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Indecomposable local maps of tessellation automata
- Condition for injectivity of global maps for tessellation automata
- Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
- Local maps inducing surjective global maps of one-dimensional tessellation automata
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Endomorphisms and automorphisms of the shift dynamical system
- The Garden-of-Eden Theorem for Finite Configurations
This page was built for publication: Linear cellular automata over \(Z_ m\)
