Basic properties for sand automata
Computational Complexity
2007-05-23 v1
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.
Cite
@article{arxiv.cs/0411007,
title = {Basic properties for sand automata},
author = {Julien Cervelle and Enrico Formenti and Benoit Masson},
journal= {arXiv preprint arXiv:cs/0411007},
year = {2007}
}
Comments
submitted to STACS 2005