Basic properties for sand automata

Julien Cervelle (1) , Enrico Formenti (2) , Benoît Masson (2)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 I3S - Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis

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 nilpotency is undecidable. We believe that the proof technique used for this last result might reveal useful for many other results in this context.

Mots clés: sand automata; reversibility; undecidability

Domaines: Complexité [cs.CC]

Julien Cervelle, Enrico Formenti, Benoît Masson. Basic properties for sand automata. Theoretical Computer Science, 2007, 381, pp.1--28. ⟨hal-00003208⟩