Disks, balls, and walls: analysis of a combinatorial game
American Mathematical Monthly
Games on line graphs and sand piles
Theoretical Computer Science
Chip-Firing Games on Directed Graphs
Journal of Algebraic Combinatorics: An International Journal
The structure of a linear chip firing game and related models
Theoretical Computer Science
Fundamental study: From sandpiles to sand automata
Theoretical Computer Science
Sand automata as cellular automata
Theoretical Computer Science
Basic properties for sand automata
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Sand piles: From physics to cellular automata models
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we introduce sand automata in order to give a common and useful framework for the study of most of the models of sandpiles. Moreover we give the possibility to have sources and sinks of "sand grains". We prove a result which shows that the class of sand automata is rich enough to simulate any reasonable model of sandpiles based on local interaction rules. We also give an algorithm to find the fixed points of the evolutions of the sandpiles. Finally we prove that reversibility is equivalent to bijectivity.