A family of sand automata

DOI10.1016/J.TCS.2014.11.005zbMATH Open1314.68194arXiv1205.3960OpenAlexW1996579752MaRDI QIDQ482286FDOQ482286

Authors: Nicholas Faulkner, Reem Yassawi 

Publication date: 22 December 2014

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

Abstract: We study some dynamical properties of a family of two-dimensional cellular automata: those that arise from an underlying one dimensional sand automaton whose local rule is obtained using a latin square. We identify a simple sand automaton G whose local rule is algebraic, and classify this automaton as having equicontinuity points, but not being equicontinuous. We also show it is not surjective. We generalise some of these results to a wider class of sand automata.

Full work available at URL: https://arxiv.org/abs/1205.3960

Recommendations

• Mathematical Foundations of Computer Science 2005
• Sand automata as cellular automata
• scientific article; zbMATH DE number 1962851
• scientific article; zbMATH DE number 32904
• From sandpiles to sand automata

zbMATH Keywords

surjectivityequicontinuityhigher-dimensional cellular automatasand automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Self-organized criticality
• On Devaney's Definition of Chaos
• Endomorphisms and automorphisms of the shift dynamical system
• Title not available (Why is that?)
• Limit measures for affine cellular automata
• On the directional dynamics of additive cellular automata
• Solution of some conjectures about topological properties of linear cellular automata
• Decidable Properties of 2D Cellular Automata
• 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
• Transitive Cellular Automata are Sensitive
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Algebraic properties of cellular automata
• A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
• 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\)
• (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata

Cited In (2)

• Mathematical Foundations of Computer Science 2005
• Sand automata as cellular automata

This page was built for publication: A family of sand automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482286)