T. V. Alekseyevskaya and A. G. Malenkov, Mathematical model of the initiation of near weekly fluctuations in tissue (cellular automata), Biophysics, vol.36, issue.2, p.356, 1991.

P. Bak, K. Chen, and C. Tang, A forest-fire model and some thoughts on turbulence, Physics Letters A, vol.147, issue.5, pp.297-300, 1990.

F. Becker, D. Maldonado, N. Ollinger, and G. Theyssier, Universality in freezing cellular automata, Sailing Routes in the World of Computation -14th Conference on Computability in Europe, CiE, pp.50-59, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01772500

F. Becker and P. Meunier, It's a tough nanoworld: in tile assembly, cooperation is not (strictly) more powerful than competition, 2015.

R. Berger, The undecidability of the domino problem, Mem. Amer. Math Soc, vol.66, 1966.

S. Capobianco, P. Guillon, and J. Kari, Surjective cellular automata far from the garden of eden, Discrete Mathematics & Theoretical Computer Science, vol.15, issue.3, pp.41-60, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00966380

O. Carton, B. Guillon, and F. Reiter, Counter machines and distributed automata -A story about exchanging space and time, Cellular Automata and Discrete Complex Systems -24th IFIP WG 1.5 International Workshop, AUTOMATA 2018, pp.13-28, 2018.

B. Chopard and M. Droz, Cellular Automata Modeling of Physical Systems, 2005.

M. Delacourt, Rice's theorem for mu-limit sets of cellular automata, 2011.

J. Delvenne, P. Kurka, and V. D. Blondel, Decidability and universality in symbolic dynamical systems, Fundam. Inform, vol.74, issue.4, pp.463-490, 2006.

D. Doty, M. J. Patitz, and S. M. Summers, Limitations of self-assembly at temperature 1. Theor. Comput, Sci, vol.412, issue.1-2, pp.145-158, 2011.

M. Fuentes and M. Kuperman, Cellular automata and epidemiological models with spatial dependence, Physica A: Statistical Mechanics and its Applications, vol.267, issue.3-4, pp.471-486, 1999.

A. Gajardo, J. Kari, and A. Moreira, On time-symmetry in cellular automata, Journal of Computer and System Sciences, vol.78, issue.4, pp.1115-1126, 2012.

E. Goles, N. Ollinger, and G. Theyssier, Exploratory Papers of Cellular Automata and Discrete Complex Systems (AUTOMATA 2015), pp.65-73, 2015.

E. Goles, D. Maldonado, P. Montealegre, and N. Ollinger, On the computational complexity of the freezing non-strict majority automata, Cellular Automata and Discrete Complex Systems -23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, pp.109-119, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01656355

G. Ch, E. Meunier, P. Rapaport, I. Theyssier, and G. , Communication complexity and intrinsic universality in cellular automata, Theor. Comput. Sci, vol.412, issue.1-2, pp.2-21, 2011.

J. Gravner and D. Griffeath, Cellular automaton growth on z2: Theorems, examples, and problems, Advances in Applied Mathematics, vol.21, issue.2, pp.241-304, 1998.

D. Griffeath and C. Moore, Life without death is P-complete, Complex Systems, vol.10, 1996.

P. Guillon, Automates cellulaires : dynamiques, simulations, traces, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00432058

A. M. Harao, Computation universality of one-dimensional reversible (injective) cellular automata, The trans. of the EICE E, vol.72, issue.6, 1989.

G. A. Hedlund, Endomorphisms and Automorphisms of the Shift Dynamical Systems, Mathematical Systems Theory, vol.3, issue.4, pp.320-375, 1969.

A. E. Holroyd, Sharp metastability threshold for two-dimensional bootstrap percolation, Probability Theory and Related Fields, vol.125, pp.195-224, 2003.

J. Kari, The Nilpotency Problem of One-dimensional Cellular Automata, SIAM Journal on Computing, vol.21, pp.571-586, 1992.

J. Kari, Rice's theorem for the limit sets of cellular automata, Theoretical Computer Science, vol.127, pp.229-254, 1994.

J. Kari and N. Ollinger, Periodicity and immortality in reversible computing, Mathematical Foundations of Computer Science, pp.419-430, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00270815

P. K?rka, Topological and symbolic dynamics, 2003.

E. Kushilevitz and N. Nisan, Communication complexity, 1997.

M. Kutrib and A. Malcher, Cellular automata with sparse communication, Theor. Comput. Sci, vol.411, pp.3516-3526, 2010.

J. I. Lathrop, J. H. Lutz, M. J. Patitz, and S. M. Summers, Computability and complexity in selfassembly, Theory Comput. Syst, vol.48, issue.3, pp.617-647, 2011.

A. Maruoka and M. Kimura, Condition for Injectivity of Global Maps for Tessellation Automata, Information and Control, vol.32, pp.158-162, 1976.

M. Minsky, Computation: Finite and Infinite Machines, 1967.

A. Moreira, Universality and decidability of number-conserving cellular automata, Theoretical Computer Science, vol.292, 2003.

K. Nagel and M. Schreckenberg, A cellular automaton model for freeway traffic, J. Phys, vol.2, pp.2221-2229, 1992.
URL : https://hal.archives-ouvertes.fr/jpa-00246697

T. Neary and D. Woods, P-completeness of cellular automaton rule 110, In International Colloquium on Automata Languages and Programming (ICALP), vol.4051, pp.132-143, 2006.

N. Ollinger, Universalities in cellular automata a (short) survey. In: JAC, pp.102-118, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00271840

M. J. Patitz, An introduction to tile-based self-assembly and a survey of recent results, Natural Computing, vol.13, issue.2, pp.195-224, 2014.

M. J. Patitz, R. T. Schweller, and S. M. Summers, Exact shapes and turing universality at temperature 1 with a single negative glue, Proceedings of the 17th international conference on DNA computing and molecular programming, vol.11, pp.175-189, 2011.

M. Pivato, Ergodic theory of cellular automata, Encyclopedia of Complexity and Systems Science, pp.2980-3015, 2009.

H. Rogers, Theory of Recursive Functions and Effective Computability, 1967.

V. Salo, On nilpotency and asymptotic nilpotency of cellular automata, Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, AUTOMATA & JAC 2012, pp.86-96, 2012.

V. Terrier, Language Recognition by Cellular Automata, pp.123-158, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01086432

S. M. Ulam, On some mathematical problems connected with patterns of growth of figures, Essays on Cellular Automata, pp.219-231, 1970.

R. Vollmar, On cellular automata with a finite number of state changes, Parallel Processes and Related Automata / Parallele Prozesse und damit zusammenhängende Automaten, vol.3, pp.181-191, 1981.

A. Winslow, A brief tour of theoretical tile self-assembly, Cellular Automata and Discrete Complex Systems -22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, pp.26-31, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01435031

A. C. Yao, Some complexity questions related to distributive computing (preliminary report). In: STOC. pp, pp.209-213, 1979.