Abstract
This text presents some notes on the classification of simple rules in one and two dimensions. We focus on the 256 Elementary Cellular Automata and the 64 totalistic rules with von Neumann neighbourhood. The updating scheme is fully asynchronous updating, that is, only one cell is updated randomly and uniformly at each time step.
While a partial classification of such rules has been proposed some years ago, very few progress has been made since then. In order to spot the obstacles to a complete classification, we here mainly adopt an experimental approach based on the observations of the space-time diagrams. We also give some sketch of proofs when possible and underline the interesting open problems.
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
Bušić, A., Fatès, N., Mairesse, J., Marcovici, I.: Density classification on infinite lattices and trees. Electronic Journal of Probability 18(51), 1–22 (2013), http://ejp.ejpecp.org/article/view/2325
Fatès, N.: Stochastic cellular automata solutions to the density classification problem - when randomness helps computing. Theory of Computing Systems 53(2), 223–242 (2013), http://dx.doi.org/10.1007/s00224-012-9386-3
Fatès, N., Gerin, L.: Examples of fast and slow convergence of 2D asynchronous cellular systems. Journal of Cellular Automata 4(4), 323–337 (2009)
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)
Fatès, N., Regnault, D., Schabanel, N., Thierry, É.: Asynchronous behavior of double-quiescent elementary cellular automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 455–466. Springer, Heidelberg (2006)
Fukś, H., Skelton, A.: Orbits of the bernoulli measure in single-transition asynchronous cellular automata. In: Fatès, N., Goles, E., Maass, A., Rapaport, I. (eds.) Proceedings of Automata 2011. Discrete Mathematics and Theoretical Computer Science Proceedings, DMTCS, pp. 95–112 (2011), http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAP0107
Hoffmann, J., Fatès, N., Palacios, H.: Brothers in arms? on AI planning and cellular automata. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proceedings of ECAI 2010. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 223–228. IOS Press (2010), http://dx.doi.org/10.3233/978-1-60750-606-5-223
Peper, F., Adachi, S., Lee, J.: Variations on the game of life. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 235–255. Springer, London (2010), http://dx.doi.org/10.1007/978-1-84996-217-9_13
Regnault, D., Schabanel, N., Thierry, E.: Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority. Theoretical Computer Science 410(47-49), 4844–4855 (2009), http://dx.doi.org/10.1016/j.tcs.2009.06.024
Rouquier, J.B., Regnault, D., Thierry, E.: Stochastic minority on graphs. Theoretical Computer Science 412(30), 3947–3963 (2011), http://dx.doi.org/10.1016/j.tcs.2011.02.028
Schüle, M., Stoop, R.: A full computation-relevant topological dynamics classification of elementary cellular automata. Chaos 22(4), 043143 (2012), http://dx.doi.org/10.1063/1.4771662
Worsch, T.: (Intrinsically?) universal asynchronous CA. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 689–698. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-33350-7_70
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fatès, N. (2013). A Note on the Classification of the Most Simple Asynchronous Cellular Automata. In: Kari, J., Kutrib, M., Malcher, A. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2013. Lecture Notes in Computer Science, vol 8155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40867-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-40867-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40866-3
Online ISBN: 978-3-642-40867-0
eBook Packages: Computer ScienceComputer Science (R0)