论文信息 - Basic Properties for Sand Automata

Basic Properties for Sand Automata

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.

[1] G. A. Hedlund. Endomorphisms and automorphisms of the shift dynamical system , 1969, Mathematical systems theory.

[2] Eric Goles Ch.,et al. Sandpiles and order structure of integer partitions , 2002, Discret. Appl. Math..

[3] Enrico Formenti,et al. On Sand Automata , 2003, STACS.

[4] P. Bak,et al. A forest-fire model and some thoughts on turbulence , 1990 .

[5] Eric Goles Ch.,et al. Games on Line Graphs and Sand Piles , 1993, Theor. Comput. Sci..

[6] Eric Goles Ch.,et al. The structure of a linear chip firing game and related models , 2002, Theor. Comput. Sci..

[7] D. Turcotte,et al. Self-organized criticality , 1999 .

[8] P. Bak,et al. Earthquakes as a self‐organized critical phenomenon , 1989 .

[9] Isaac D. Scherson,et al. An analysis of diffusive load-balancing , 1994, SPAA '94.

[10] Bruno Durand. The Surjectivity Problem for 2D Cellular Automata , 1994, J. Comput. Syst. Sci..

[11] Kimmo Eriksson,et al. Reachability is Decidable in the Numbers Game , 1994, Theor. Comput. Sci..

[12] Enrico Formenti,et al. On undecidability of equicontinuity classification for cellular automata , 2003, DMCS.