Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
From MaRDI portal
Publication:1941707
DOI10.1016/j.ipl.2012.12.009zbMath1259.68139OpenAlexW2000403590MaRDI QIDQ1941707
Alberto Dennunzio, Luigi Acerbi, Enrico Formenti
Publication date: 21 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.12.009
Combinatorics in computer science (68R05) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Symbolic dynamics (37B10)
Related Items
\(m\)-asynchronous cellular automata: from fairness to quasi-fairness, Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues, Complexity of the dynamics of reaction systems, Three research directions in non-uniform cellular automata, Computational complexity of finite asynchronous cellular automata, Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties