A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)

From MaRDI portal
Revision as of 16:36, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1960524

DOI10.1016/S0304-3975(99)00031-6zbMath0930.68090MaRDI QIDQ1960524

Giovanni Manzini, Luciano Margara

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)




Related Items (28)

A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z mChaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issuesDecidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryptionThe Entropy and Reversibility of Cellular Automata on Cayley TreeClassifying 1D elementary cellular automata with the 0-1 test for chaosEfficient 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.Combinatorial constructions associated to the dynamics of one-sided cellular automata.The impact of alphabet size on pattern complexity of maxmin-\( \omega\) cellular automataAn efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryptionOn the dynamical behaviour of linear higher-order cellular automata and its decidabilityInversion of circulant matrices over $\mathbf{Z}_m$Three research directions in non-uniform cellular automataA family of sand automataAn efficiently computable characterization of stability and instability for linear cellular automataNondeterministic cellular automataTopological transitivity and mixing notions for group actionsDynamical properties of a cellular automaton on a countable groupDynamical behavior of additive cellular automata over finite abelian groupsOn the hierarchy of conservation laws in a cellular automatonTheory of cellular automata: a surveyOn the Asymptotic Behavior of Fuzzy Cellular AutomataPre-expansivity in cellular automataAdditive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic PropertiesOn the directional dynamics of additive cellular automataOn the dynamical behavior of chaotic cellular automataDecidability and undecidability in cellular automata




Cites Work




This page was built for publication: A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)