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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bak, P.: How nature works - The science of SOC. Oxford University Press, Oxford (1997)
Bak, P., Tang, C.: Earthquakes as a self-organized critical phenomenon. J. Geo- phys. Res. 94, 15635–15637 (1989)
Bak, P., Chen, K., Tang, C.: A forest-fire model and some thoughts on turbulence. Physics letters A 147, 297–300 (1990)
Bak, P., Tang, C., Wiesenfeld, K.: Self-organized criticality. Physical Review A 38, 364–374 (1988)
Subramanian, R., Scherson, I.: An analysis of diffusive load-balancing. In: ACM Symposium on Parallel Algorithms and Architecture (SPAA 1994), pp. 220–225. ACM Press, New York (1994)
Goles, E., Kiwi, M.A.: Games on line graphs and sand piles. Theoretical Computer Science 115, 321–349 (1993)
Goles, E., Morvan, M., Phan, H.D.: Sand piles and order structure of integer partitions. Discrete Applied Mathematics 117, 51–64 (2002)
Cervelle, J., Formenti, E.: On sand automata. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 642–653. Springer, Heidelberg (2003)
Hedlund, G.A.: Endomorphism and automorphism of the shift dynamical system. Mathematical System Theory 3, 320–375 (1969)
Durand, B.: Global properties of cellular automata. In: Goles, E., Martinez, S. (eds.) Cellular Automata and Complex Systems, Kluwer, Dordrecht (1998)
Durand, B.: The surjectivity problem for 2d cellular automata. Journal of Com- puter and Systems Science 49, 718–725 (1994)
Goles, E., Morvan, M., Phan, H.D.: The structure of a linear chip firing game and related models. Theoretical Computer Science 270, 827–841 (2002)
Durand, B., Formenti, E., Varouchas, G.: On undecidability of equicontinuity classification for cellular automata. In: Morvan, M., Rémila, É. (eds.) Discrete Models for Complex Systems DMCS 2003. Proceedings., Discrete Mathematics and Theoretical Computer Science, vol. AB of DMTCS, pp. 117–128 (2003)
Eriksson, K.: Reachability is decidable in the numbers game. Theoretical Computer Science 131, 431–439 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cervelle, J., Formenti, E., Masson, B. (2005). Basic Properties for Sand Automata. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_18
Download citation
DOI: https://doi.org/10.1007/11549345_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)