Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\)

DOI10.1016/S0020-0190(96)00206-2zbMath0925.68325MaRDI QIDQ1392061

Tadakazu Sato

Publication date: 23 July 1998

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Theory of computationLinear cellular automatonLocal mapParallel map

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (6)

Solution of some conjectures about topological properties of linear cellular automata ⋮ A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\) ⋮ On the directional dynamics of additive cellular automata ⋮ Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\) ⋮ On the ergodic properties of certain additive cellular automata over \(\mathbb Z_{m}\) ⋮ Attractors of linear cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Linear cellular automata over \(Z_ m\)
• Dynamical characteristics of linear cellular automata
• Certain relations between properties of maps of tessellation automata
• Decidability for some problems of linear cellular automata over finite commutative rings
• Group structured linear cellular automata over \(Z_ m\)
• On the ergodic theory of cellular automata
• Condition for injectivity of global maps for tessellation automata
• Endomorphisms and automorphisms of the shift dynamical system

This page was built for publication: Ergodicity of linear cellular automata over \({\mathbb Z}_{m}\)