References

  1. P. Arrighi & J. Grattage (2009): Intrinsically universal n-dimensional quantum cellular automata. J. of Computer and Systems Sciences, to appear..
  2. Pablo Arrighi, Renan Fargetton, Vincent Nesme & Eric Thierry (2011): Applying Causality Principles to the Axiomatization of Probabilistic Cellular Automata. In: CiE, pp. 1–10. Available at http://dx.doi.org/10.1007/978-3-642-21875-0_1.
  3. Ana Busic, Jean Mairesse & Irene Marcovici (2010): Probabilistic cellular automata, invariant measures, and perfect sampling. Pre-print arXiv:1010.3133.
  4. Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger & Guillaume Theyssier (2011): Bulking I: An abstract theory of bulking. Theor. Comput. Sci. 412(30), pp. 3866–3880. Available at http://dx.doi.org/10.1016/j.tcs.2011.02.023.
  5. Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger & Guillaume Theyssier (2011): Bulking II: Classifications of cellular automata. Theor. Comput. Sci. 412(30), pp. 3881–3905. Available at http://dx.doi.org/10.1016/j.tcs.2011.02.024.
  6. Nazim Fates (2011): Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. In: Thomas Schwentick & Christoph Dürr: STACS, LIPIcs 9. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 284–295, doi:10.4230/LIPIcs.STACS.2011.284.
  7. Nazim Fatès, Damien Regnault, Nicolas Schabanel & Eric Thierry (2006): Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. In: LATIN, pp. 455–466, doi:10.1007/11682462_43.
  8. P. Gacs (2001): Reliable cellular automata with self-organization. Journal of Statistical Physics 103(1), pp. 45–267.
  9. G. A. Hedlund (1969): Endormorphisms and automorphisms of the shift dynamical system. Mathematical Systems Theory 3, pp. 320–375.
  10. Jarkko Kari (1994): Reversibility and Surjectivity Problems of Cellular Automata. J. Comput. Syst. Sci. 48(1), pp. 149–182. Available at http://dx.doi.org/10.1016/S0022-0000(05)80025-X.
  11. P. Kůrka (2003): Topological and symbolic dynamics. Société Mathématique de France.
  12. A. Maruoka & M. Kimura (1976): Condition for Injectivity of Global Maps for Tessellation Automata. Information and Control 32, pp. 158–162.
  13. N. Ollinger (2002): Automates cellulaires : structures. École Normale Supérieure de Lyon.
  14. Nicolas Ollinger (2002): The Quest for Small Universal Cellular Automata. In: ICALP, pp. 318–329. Available at http://dx.doi.org/10.1007/3-540-45465-9_28.
  15. Nicolas Ollinger (2008): Universalities in cellular automata a (short) survey. In: JAC, pp. 102–118.
  16. Nicolas Ollinger & Gaétan Richard (2011): Four states are enough!. Theor. Comput. Sci. 412(1-2), pp. 22–32. Available at http://dx.doi.org/10.1016/j.tcs.2010.08.018.
  17. Marcus Pivato (2009): Ergodic Theory of Cellular Automata. In: Encyclopedia of Complexity and Systems Science. Springer, pp. 2980–3015, doi:10.1007/978-0-387-30440-3_178.
  18. I. Rapaport (1998): Inducing an order on cellular automata by a grouping operation. École Normale Supérieure de Lyon.
  19. D. Regnault, N. Schabanel & É. Thierry (2009): Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority. Theoretical Computer Science 410(47-49), pp. 4844–4855.
  20. G. Theyssier (2005): Automates cellulaires : un modèle de complexités. École Normale Supérieure de Lyon.
  21. A. Toom (1995): Cellular automata with errors: Problems for students of probability. Topics in Contemporary Probability and Its Applications, pp. 117–157.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org