Un langage quasi-rationnel lié aux graphes planaires
In memoriam
Une preuve combinatoire de la rationalité d'une série génératrice associée aux arbres
Automates et commutations partielles
Partially abelian squarefree words
Signed Chip Firing Games and symmetric Sandpile Models on the cycles
We investigate the Sandpile Model and Chip Firing Game and an extension of these models on cycle graphs. The extended model consists of allowing a negative number of chips at each vertex. We give the characterization of reachable configurations and of fixed points of each model. At the end, we give explicit formula for the number of their fixed points.
Introduction à l'algorithmique des objets partagés
Page 1