A Note on the Classification of the Most Simple Asynchronous Cellular Automata
暂无分享,去创建一个
[1] E. F. Codd,et al. Cellular automata , 1968 .
[2] Nazim Fatès,et al. Fully asynchronous behavior of double-quiescent elementary cellular automata , 2006, Theor. Comput. Sci..
[3] Jörg Hoffmann,et al. Brothers in Arms? On AI Planning and Cellular Automata , 2010, ECAI.
[4] Damien Regnault,et al. Stochastic minority on graphs , 2010, Theor. Comput. Sci..
[5] Henryk Fuks,et al. Orbits of the Bernoulli measure in single-transition asynchronous cellular automata , 2011, Automata.
[6] Nazim Fatès,et al. Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata , 2005, MFCS.
[7] J. Mairesse,et al. Density classification on infinite lattices and trees , 2013 .
[8] Damien Regnault,et al. Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority , 2007, Theor. Comput. Sci..
[9] Ferdinand Peper,et al. Variations on the Game of Life , 2010, Game of Life Cellular Automata.
[10] Nazim Fatès,et al. Stochastic Cellular Automata Solutions to the Density Classification Problem , 2012, Theory of Computing Systems.
[11] Nazim Fatès,et al. Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems , 2008, J. Cell. Autom..
[12] Nazim Fatès,et al. Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata , 2006, LATIN.
[13] Thomas Worsch,et al. (Intrinsically?) Universal Asynchronous CA , 2012, ACRI.
[14] Andrew Adamatzky,et al. Game of Life Cellular Automata , 2010 .
[15] Marcos Kiwi,et al. LATIN 2006: Theoretical Informatics , 2006, Lecture Notes in Computer Science.
[16] Ruedi Stoop,et al. A full computation-relevant topological dynamics classification of elementary cellular automata. , 2012, Chaos.