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

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

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

E. R. Banks, Information processing and transmission in cellular automata, Massachusetts Institute of Technology, 1971.

A. R. Smith, Simple Computation-Universal Cellular Spaces, Journal of the ACM, vol.18, issue.3, pp.339-353, 1971.
DOI : 10.1145/321650.321652

B. Durand and Z. Róka, The Game of Life: Universality Revisited, Cellular automata, pp.51-74, 1996.
DOI : 10.1007/978-94-015-9153-9_2

E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning ways for your mathematical plays, 1982.

J. Albert and K. Culik, II, A simple universal cellular automaton and its one-way and totalistic version, Complex Systems, vol.1, issue.1, pp.1-16, 1987.

N. Ollinger, Automates cellulaires : structures, 2002.
URL : https://hal.archives-ouvertes.fr/tel-00007765

G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory, vol.18, issue.4, pp.320-375, 1969.
DOI : 10.1007/BF01691062

D. Richardson, Tessellations with local transformations, Journal of Computer and System Sciences, vol.6, issue.5, pp.373-388, 1972.
DOI : 10.1016/S0022-0000(72)80009-6

J. Kari, Theory of cellular automata: A survey, Theoretical Computer Science, vol.334, issue.1-3, pp.3-33, 2005.
DOI : 10.1016/j.tcs.2004.11.021

G. Theyssier, Automates cellulaires : un modèle de complexités, 2005.

M. Delorme, J. Mazoyer, N. Ollinger, and G. Theyssier, Bulking I: An abstract theory of bulking, Theoretical Computer Science, vol.412, issue.30
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
DOI : 10.1016/j.tcs.2011.02.024
URL : https://hal.archives-ouvertes.fr/hal-00451727

N. Ollinger, The Intrinsic Universality Problem of One-Dimensional Cellular Automata, Symposium on Theoretical Aspects of Computer Science (STACS'2003), pp.632-641, 2003.
DOI : 10.1007/3-540-36494-3_55

J. Mazoyer and I. Rapaport, Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results, Discrete Mathematics, vol.199, issue.1-3, pp.103-122, 1999.
DOI : 10.1016/S0012-365X(98)00203-9

N. Ollinger, P. Widmayer, F. Triguero, R. Morales, M. Hennessy et al., The Quest for Small Universal Cellular Automata, International Colloquium on Automata, languages and programming, pp.318-329, 2002.
DOI : 10.1007/3-540-45465-9_28

M. Cook, Universality in elementary cellular automata, Complex Systems, vol.15, pp.1-40, 2004.

G. Richard, Rule 110: universality and catenations, Symposium on Cellular Automata Journées Automates Cellulaires (JAC'2008), pp.141-160, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00273995

S. Wolfram, A New Kind of Science, Applied Mechanics Reviews, vol.56, issue.2, 2002.
DOI : 10.1115/1.1553433

N. Ollinger and G. Richard, Collisions and their Catenations: Ultimately Periodic Tilings of the Plane, pp.229-240, 2008.
DOI : 10.1007/978-0-387-09680-3_16
URL : https://hal.archives-ouvertes.fr/hal-00175397

W. Hordijk, C. R. Shalizi, and J. P. Crutchfield, Upper bound on the products of particle interactions in cellular automata, Physica D: Nonlinear Phenomena, vol.154, issue.3-4, pp.3-4, 2001.
DOI : 10.1016/S0167-2789(01)00252-4

T. Neary and D. Woods, P-completeness of Cellular Automaton Rule 110, Proceedings of ICALP 2006, pp.132-143, 2006.
DOI : 10.1007/11786986_13