A family of sand automata

Faulkner, Nicholas and Yassawi, Reem (2015). A family of sand automata. Theoretical Computer Science, 565 pp. 50–62.

DOI: https://doi.org/10.1016/j.tcs.2014.11.005


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 Γ whose local rule is algebraic, and classify this automaton as having equicontinuity points, but not being equicontinuous. We also show that it is not surjective. We generalise some of these results to a wider class of sand automata.

Viewing alternatives

Download history


Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions

Item Actions