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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Cervelle, J., Formenti, E., & Masson, B. (2005). Basic properties for sand automata. In Lecture Notes in Computer Science (Vol. 3618, pp. 192–211). Springer Verlag. https://doi.org/10.1007/11549345_18
Mendeley helps you to discover research relevant for your work.