Basic Properties for Sand Automata

We prove several results about the relations between injectivity and surjectivity for sand automata. Moreover, we begin the exploration of the dynamical behavior of sand automata proving that the property of ultimate periodicity is undecidable. We believe that the proof technique used for this last result might turn out to be useful for many other results in the same context.

• Type: Conference
• Year: 2005
• Where: MFCS
• Authors: Julien Cervelle, Enrico Formenti, Benoît Masson
• Keywords: MFCS 2005, Sand Automata, Ultimate Periodicity, We Believe