Abstract
In this paper we study the family of two-state Totalistic Freezing Cellular Automata (FTCA) defined over the triangular grids with von Neumann neighborhoods. We say that a Cellular Automaton is Freezing and Totalistic if the active cells remain unchanged, and the new value of an inactive cell depends only of the sum of its active neighbors. We study the family of FTCA in the context of asynchronous updating schemes (calling them FTACA), meaning that at each time-step only one cell is updated. The sequence of updated sites is called a sequential updating schemes. Given configuration, we say that a site is stable if it remains in the same state over any sequential updating scheme.
In this context, we consider the Asynchronous Stability problem, consisting in decide whether there is a sequential updating scheme such that an inactive cell becomes active. We show that in this family the problem is NC, i.e. it can be solved by fast-parallel algorithms.
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
References
Papadimitriou, C.M.: Computational Complexity. Addison-Wesley, Reading (1994)
Goles, E., Ollinger, N., Theyssier, G.: Introducing freezing cellular automata. In: Cellular Automata and Discrete Complex Systems, 21st International Workshop (AUTOMATA 2015). TUCS Lecture Notes, Turku, Finland, vol. 24, pp. 65–73 (2015)
Goles, E., Montealegre-Barba, P., Todinca, I.: The complexity of the bootstraping percolation and other problems. Theor. Comput. Sci. 504, 73–82 (2013)
Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601–644 (1983)
Goles, E., Montealegre, P.: A fast parallel algorithm for the robust prediction of the two-dimensional strict majority automaton. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds.) ACRI 2016. LNCS, vol. 9863, pp. 166–175. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44365-2_16
JáJá, J.: An Introduction to Parallel Algorithms. Addison Wesley Longman Publishing Co. Inc., Redwood City (1992)
JáJá, J., Simon, J.: Parallel algorithms in graph theory: planarity testing. SIAM J. Comput. 11(2), 314–328 (1982)
Acknowledgments
Research founded by CONICYT+PAI+CONVOCATORIA NACIONAL SUBVENCIÓN A INSTALACIÓN EN LA ACADEMIA CONVOCATORIA AÑO 2017 + PAI77170068 (P.M.)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Goles, E., Maldonado, D., Montealegre-Barba, P., Ollinger, N. (2018). Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds) Cellular Automata. ACRI 2018. Lecture Notes in Computer Science(), vol 11115. Springer, Cham. https://doi.org/10.1007/978-3-319-99813-8_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-99813-8_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99812-1
Online ISBN: 978-3-319-99813-8
eBook Packages: Computer ScienceComputer Science (R0)