A family of sand automata

作者：Faulkner Nicholas^*; Yassawi Reem

来源：Theoretical Computer Science, 2015, 565: 50-62.

DOI：10.1016/j.tcs.2014.11.005

• Sand automata
• Higher-dimensional cellular automata
• Equicontinuity
• Surjectivity

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 Gamma 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.

• 出版日期2015-2-2