Decidability for some problems of linear cellular automata over finite commutative rings
From MaRDI portal
Publication:1261489
DOI10.1016/0020-0190(93)90061-DzbMath0850.68248OpenAlexW2066306854MaRDI QIDQ1261489
Publication date: 26 February 1996
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90061-d
Related Items (7)
Additive cellular automata and global injectivity ⋮ Surjective linear cellular automata over \({\mathbb{Z}}_{m}\) ⋮ Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\) ⋮ Theory of cellular automata: a survey ⋮ Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects ⋮ Ergodic characterization of linear cellular automata over \(Z_{m}\) ⋮ Graph-theoretical characterization of invertible cellular automata
Cites Work
- Unnamed Item
- Dynamical characteristics of linear cellular automata
- Certain relations between properties of maps of tessellation automata
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Certain Classes of Ideals in Polynomial Rings
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: Decidability for some problems of linear cellular automata over finite commutative rings
