Abstract
This note describes a small step in the analysis of the fully asynchronous cellular automata (i.e., the cells are updated uniformly at random at each time step). We establish the rapid convergence of fifteen minimal Elementary Cellular Automata, showing that their average convergence time to a fixed point scales logarithmically with the size of the automaton. Techniques involve the use of Markov chain analysis and the construction of adequate potential functions. The problem is however left open for twelve other minimal rules, which shows the need to develop this analysis further.
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
Dennunzio, A., Formenti, E., Manzoni, L.: Computing issues of asynchronous CA. Fundamenta Informaticae 120(2), 165–180 (2012)
Fatès, N.: A guided tour of asynchronous cellular automata. In: Kari, J., Kutrib, M., Malcher, A. (eds.) AUTOMATA 2013. LNCS, vol. 8155, pp. 15–30. Springer, Heidelberg (2013)
Fatès, N.: A note on the classification of the most simple asynchronous cellular automata. In: Kari, J., Kutrib, M., Malcher, A. (eds.) AUTOMATA 2013. LNCS, vol. 8155, pp. 31–45. Springer, Heidelberg (2013)
Fatès, N., Morvan, M., Schabanel, N., Thierry, E.: Fully asynchronous behavior of double-quiescent elementary cellular automata. Theoretical Computer Science 362, 1–16 (2006)
Sethi, B., Fatès, N., Das, S.: Reversibility of elementary cellular automata under fully asynchronous update. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 39–49. Springer, Heidelberg (2014)
Sethi, B., Roy, S., Das, S.: Experimental study on convergence time of elementary cellular automata under asynchronous update. In: Kari, J., Kutrib, M., Malcher, A. (eds.) Proceedings of AUTOMATA 2013 - Exploratory Papers. Giessen University - IFIG Research Report 1302 (2013)
Worsch, T.: (Intrinsically?) universal asynchronous CA. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 689–698. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fatès, N. (2014). Quick Convergence to a Fixed Point: A Note on Asynchronous Elementary Cellular Automata. In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2014. Lecture Notes in Computer Science, vol 8751. Springer, Cham. https://doi.org/10.1007/978-3-319-11520-7_62
Download citation
DOI: https://doi.org/10.1007/978-3-319-11520-7_62
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11519-1
Online ISBN: 978-3-319-11520-7
eBook Packages: Computer ScienceComputer Science (R0)