Skip to Main content Skip to Navigation
New interface
Journal articles

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
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Benoît Masson Connect in order to contact the contributor
Submitted on : Thursday, November 4, 2004 - 12:45:29 PM
Last modification on : Thursday, August 4, 2022 - 4:53:00 PM
Long-term archiving on: : Thursday, April 1, 2010 - 3:36:04 PM




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



Record views


Files downloads