A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m

DOI10.1007/3-540-63165-8_232zbMath1401.37025OpenAlexW2151525607MaRDI QIDQ4572007

Giovanni Manzini, Luciano Margara

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_232

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15)

Related Items (1)

Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects

Cites Work

• Unnamed Item
• Unnamed Item
• Linear cellular automata over \(Z_ m\)
• Dynamical characteristics of linear cellular automata
• Exact results for deterministic cellular automata with additive rules
• Self-similarity of linear cellular automata
• Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
• Lyapunov exponent versus expansivity and sensitivity in cellular automata
• Group structured linear cellular automata over \(Z_ m\)
• Rice's theorem for the limit sets of cellular automata
• A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
• On the Limit Sets of Cellular Automata
• On ergodic linear cellular automata over Zm

This page was built for publication: A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m