Abstract
Extension of sand pile models, one-dimensional sand automata are an intermediate discrete dynamical system between one dimensional cellular automata and two-dimensional cellular automata. In this paper, we shall study the decidability problem of global behavior of this system. In particular, we shall focus on the problem of injectivity and surjectivity which have the property of being decidable for one-dimensional cellular automata and undecidable for two-dimensional one. We prove the following quite surprising property that surjectivity is undecidable whereas injectivity is decidable. For completeness, we also study these properties on some classical restrictions of configurations (finite, periodic and bounded ones).
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
Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. Journal of Computer and System Sciences 6(5), 448–464 (1972)
Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM Journal on Computing 21(3), 571–586 (1992)
Goles, E., Kiwi, M.A.: Games on line graphs and sand piles. Theoretical Computer Science 115(2), 321–349 (1993)
Cervelle, J., Formenti, E., Masson, B.: From sandpiles to sand automata. Theoretical Computer Science 381(1-3), 1–28 (2007)
Dennunzio, A., Guillon, P., Masson, B.: Stable dynamics of sand automata. In: Fifth Ifip International Conference on Theoretical Computer Science, TCS 2008, vol. 273, pp. 157–169 (2008)
Dennunzio, A., Guillon, P., Masson, B.: Sand automata as cellular automata. Accepted to TCS (2008) (under revision)
Cervelle, J., Formenti, E., Masson, B.: Basic properties for sand automata. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 192–211. Springer, Heidelberg (2005)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall, Englewoods Cliffs (1967)
Kari, J.: Reversibility and surjectivity problems of cellular automata. J. Comput. Syst. Sci. 48(1), 149–182 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Richard, G. (2009). (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata. In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-03816-7_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03815-0
Online ISBN: 978-3-642-03816-7
eBook Packages: Computer ScienceComputer Science (R0)