Basic properties for sand automata

Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00003208
Contributor : Benoît Masson <>
Submitted on : Thursday, November 4, 2004 - 12:45:29 PM
Last modification on : Friday, April 12, 2019 - 10:18:03 AM
Document(s) archivé(s) le : Thursday, April 1, 2010 - 3:36:04 PM

Files

Identifiers

Citation

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

Share

Metrics

Record views

299

Files downloads

116