Basic properties for sand automata

Authors:
J. Cervelle;E. Formenti;B. Masson
Affiliations:
Institut Gaspard Monge, Université de Marne-la-Vallée, Marne-la-Vallée cedex 2, France;Laboratoire I3S, Bât. ESSI, Université de Nice-Sophia Antipolis, Sophia Antipolis, France;Laboratoire I3S, Bât. ESSI, Université de Nice-Sophia Antipolis, Sophia Antipolis, France
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 6
Cited 1

Games on line graphs and sand piles

Theoretical Computer Science
An analysis of diffusive load-balancing

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Reachability is decidable in the numbers game

Theoretical Computer Science
Regular Article: The surjectivity problem for 2D cellular automata

Proceedings of the 30th IEEE symposium on Foundations of computer science
The structure of a linear chip firing game and related models

Theoretical Computer Science
On Sand Automata

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

Sand piles: From physics to cellular automata models

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 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.