E. R. Banks, Universality in cellular automata, 11th Annual Symposium on Switching and Automata Theory (swat 1970), 1970.
DOI : 10.1109/SWAT.1970.27

B. Bollobás, P. Smith, and A. Uzzell, Monotone Cellular Automata in a Random Environment, Combinatorics, Probability and Computing, vol.28, issue.04, pp.687-722, 2015.
DOI : 10.1016/0378-4371(90)90280-6

J. Chalupa, P. L. Leath, and G. R. Reich, Bootstrap percolation on a Bethe lattice, Journal of Physics C: Solid State Physics, vol.12, issue.1, pp.31-35, 1979.
DOI : 10.1088/0022-3719/12/1/008

M. Delorme, J. Mazoyer, N. Ollinger, and G. Theyssier, Bulking I: An abstract theory of bulking, Theoretical Computer Science, vol.412, issue.30, pp.3866-3880, 2011.
DOI : 10.1016/j.tcs.2011.02.023
URL : https://hal.archives-ouvertes.fr/hal-00451732

M. Delorme, J. Mazoyer, N. Ollinger, and G. Theyssier, Bulking II: Classifications of cellular automata, Theoretical Computer Science, vol.412, issue.30, pp.3881-3905, 2011.
DOI : 10.1016/j.tcs.2011.02.024
URL : https://hal.archives-ouvertes.fr/hal-00451727

D. Doty, J. H. Lutz, M. J. Patitz, R. T. Schweller, S. M. Summers et al., The Tile Assembly Model is Intrinsically Universal, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.302-310, 2012.
DOI : 10.1109/FOCS.2012.76
URL : http://arxiv.org/pdf/1111.3097

M. A. Fuentes and M. N. Kuperman, Cellular automata and epidemiological models with spatial dependence. Physica A: Statistical Mechanics and its Applications, pp.3-4471, 1999.
DOI : 10.1016/s0378-4371(99)00027-8

E. Goles, D. Maldonado, P. Montealegre, and N. Ollinger, On the Computational Complexity of the Freezing Non-strict Majority Automata, AUTOMATA, pp.109-119, 2017.
DOI : 10.1137/0211024
URL : https://hal.archives-ouvertes.fr/hal-01656355

E. Goles, P. Montealegre-barba, and I. Todinca, The complexity of the bootstraping percolation and other problems, Theoretical Computer Science, vol.504, pp.73-82, 2013.
DOI : 10.1016/j.tcs.2012.08.001
URL : https://hal.archives-ouvertes.fr/hal-00914603

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.
DOI : 10.1006/aama.1998.0599
URL : https://doi.org/10.1006/aama.1998.0599

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

J. H. Holland, A universal computer capable of executing an arbitrary number of subprograms simultaneously, Essays on Cellular Automata, pp.264-276, 1970.

D. A. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302

P. Meunier, M. J. Patitz, S. M. Summers, G. Theyssier, A. Winslow et al., Intrinsic universality in tile self-assembly requires cooperation, SODA 2014 Proceedings, pp.752-771, 2014.
DOI : 10.1137/1.9781611973402.56
URL : https://hal.archives-ouvertes.fr/hal-00943802

J. and V. Neumann, Theory of Self-Reproducing Automata, 1966.

N. Ollinger, Universalities in Cellular Automata*, Handbook of Natural Computing, pp.189-229, 2012.
DOI : 10.1007/978-3-540-92910-9_6
URL : https://hal.archives-ouvertes.fr/hal-00980362

N. Ollinger and G. Richard, Four states are enough! Theor, Comput. Sci, vol.412, issue.1 2, pp.22-32, 2011.
DOI : 10.1016/j.tcs.2010.08.018
URL : https://doi.org/10.1016/j.tcs.2010.08.018

J. W. Thatcher, Universality in the von neumman cellular model, Essays on Cellular Automata, pp.132-186, 1970.

S. M. Ulam, On some mathematical problems connected with patterns of growth in figures, Essays on Cellular Automata, pp.219-231, 1970.
DOI : 10.1090/psapm/014/9947

R. Vollmar, On Cellular Automata with a Finite Number of State Changes, Parallel Processes and Related Automata, pp.181-191, 1981.
DOI : 10.1007/978-3-7091-8596-4_13