Dynamical characteristics of linear cellular automata
From MaRDI portal
Recommendations
Cites work
Cited in
(31)- Remarks on permutive cellular automata.
- Linear cellular automata over a finite commutative ring
- The impact of alphabet size on pattern complexity of maxmin-\( \omega\) cellular automata
- Dynamics of finite linear cellular automata over \(\mathbb Z_N\)
- Ergodic characterization of linear cellular automata over \(Z_{m}\)
- Superposable trellis automata
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Cellular automata and nonlinear dynamical models
- Theory of cellular automata: a survey
- Decidability for some problems of linear cellular automata over finite commutative rings
- On ergodic linear cellular automata over \(\mathbf{Z}_m\)
- Group structured linear cellular automata over \(Z_ m\)
- RESCALED EVOLUTION SETS OF LINEAR CELLULAR AUTOMATA ON A CYLINDER
- Linear cellular automata with boundary conditions
- Decomposition of additive cellular automata
- Linear cellular automata on Cayley graphs
- Analysis of Linear Group GF(2 p ) Cellular Automata
- scientific article; zbMATH DE number 4043250 (Why is no real title available?)
- Surjective linear cellular automata over \({\mathbb{Z}}_{m}\)
- Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group
- Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\)
- Measure theoretic approach to the classification of cellular automata
- Linear cellular automata over \(Z_ m\)
- Self-similarity of linear cellular automata
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- scientific article; zbMATH DE number 6255702 (Why is no real title available?)
- Structure theorems for isometric linear cellular automata
- A characterization of cellular automata generated by idempotents on the full shift
- Large semigroups of cellular automata.
This page was built for publication: Dynamical characteristics of linear cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092663)