A family of sand automata
From MaRDI portal
Publication:482286
DOI10.1016/j.tcs.2014.11.005zbMath1314.68194arXiv1205.3960OpenAlexW1996579752MaRDI QIDQ482286
Reem Yassawi, Nicholas Faulkner
Publication date: 22 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.3960
Cites Work
- Unnamed Item
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Conservation of some dynamical properties for operations on cellular automata
- Sand automata as cellular automata
- On the directional dynamics of additive cellular automata
- Algebraic properties of cellular automata
- Linear cellular automata over \(Z_ m\)
- Invertible linear cellular automata over \(\mathbb{Z}_m\): Algorithmic and dynamical aspects
- Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
- 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}\)
- Self-organized criticality
- (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata
- Decidable Properties of 2D Cellular Automata
- On Devaney's Definition of Chaos
- Limit measures for affine cellular automata
- Transitive Cellular Automata are Sensitive
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: A family of sand automata
