S. Amoroso and Y. Patt, Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures, Journal of Computer and System Sciences, vol.6, issue.5, pp.448-464, 1972.
DOI : 10.1016/S0022-0000(72)80013-8

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

N. Boccara, J. Nasser, and M. Roger, Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules, Physical Review A, vol.44, issue.2, pp.866-875, 1991.
DOI : 10.1103/PhysRevA.44.866

G. Cattaneo, E. Formenti, and L. Margara, Topological Definitions of Deterministic Chaos, Cellular automata, pp.213-259, 1996.
DOI : 10.1007/978-94-015-9153-9_8

G. Cattaneo, E. Formenti, L. Margara, J. Mazoyer-culik, I. et al., A new shift-invariant metric on S Z inducing a non-trivial topology On the limit sets of cellular automata, Mathematical Foundations of Computer Science (MFCS'97, pp.831-842, 1989.

B. A. Davey, H. A. Priestley, M. Delorme, J. Mazoyer, N. Ollinger et al., Introduction to Lattices and Order Bulking I: an Abstract Theory of Bulking, unpublished, oai:hal.archives-ouvertes, p.451732, 2002.

J. Durand-lose, Intrinsic universality of a 1-dimensional reversible Cellular Automaton, Symposium on Theoretical Aspects of Computer Science, 1997.
DOI : 10.1007/BFb0023479

R. H. Gilman, Classes of linear automata, Ergodic Theory and Dynamical Systems, vol.10, issue.01, pp.105-118, 1987.
DOI : 10.1007/BF01691062

E. Goles, A. Maass, and S. Martinez, On the limit set of some universal cellular automata, Theoretical Computer Science, vol.110, issue.1, 1993.
DOI : 10.1016/0304-3975(93)90350-3

D. Griffeath and C. Moore, Life without death is P-complete, Complex Systems, vol.10, issue.6, pp.437-447, 1996.

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

J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, 1979.
DOI : 10.1145/568438.568455

L. P. Hurd, Formal language characterizations of cellular automaton limit sets, Complex Systems, vol.1, pp.69-80, 1987.

K. Imai and K. Morita, Firing squad synchronization problem in reversible cellular automata, Theoretical Computer Science, vol.165, issue.2
DOI : 10.1016/0304-3975(96)00016-3

N. Israeli and N. Goldenfeld, Computational Irreducibility and the Predictability of Complex Physical Systems, Physical Review Letters, vol.92, issue.7, p.74105, 2004.
DOI : 10.1103/PhysRevLett.92.074105

J. Kari, The Nilpotency Problem of One-Dimensional Cellular Automata, SIAM Journal on Computing, vol.21, issue.3, pp.571-586, 1992.
DOI : 10.1137/0221036

P. K?rka, Languages, equicontinuity and attractors in cellular automata, Ergodic Theory and Dynamical Systems, pp.417-433, 1997.

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

D. Lind and B. Marcus, An introduction to symbolic dynamics and coding, 1995.
DOI : 10.1017/CBO9780511626302

J. Mazoyer and I. Rapaport, Additive cellular automata over ???p and the bottom of (CA,???), Mathematical foundations of computer science, pp.834-843, 1998.
DOI : 10.1007/BFb0055835

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.199-103, 1999.
DOI : 10.1016/S0012-365X(98)00203-9

J. Mazoyer and I. Rapaport, Inducing an order on cellular automata by a grouping operation, Discrete Applied Mathematics, vol.91, issue.1-3, pp.177-196, 1999.
DOI : 10.1016/S0166-218X(98)00125-5

E. F. Moore, Machines models of self-reproduction, Proceedings of Symposia in Applied Mathematics, pp.17-33, 1962.
DOI : 10.1090/psapm/014/9961

J. Myhill, The converse of Moore???s Garden-of-Eden theorem, Proceedings of the American Mathematical Society, pp.658-686, 1963.
DOI : 10.1090/S0002-9939-1963-0155764-9

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

N. Ollinger, Two-States Bilinear Intrinsically Universal Cellular Automata, 13th International Symposium, FCT 2001, pp.396-399, 2001.
DOI : 10.1007/3-540-44669-9_41

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

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

N. Ollinger, Universalities in Cellular Automata*, Symposium on Cellular Automata Journées Automates Cellulaires (JAC'08), pp.102-118, 2008.
DOI : 10.1007/978-3-540-92910-9_6
URL : https://hal.archives-ouvertes.fr/hal-00980362

M. Sablik, Directional dynamics for cellular automata: A sensitivity to initial condition approach, Theoretical Computer Science, vol.400, issue.1-3, pp.1-18, 2008.
DOI : 10.1016/j.tcs.2008.02.052

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

K. Sutner, Cellular automata and intermediate degrees, Theoretical Computer Science, vol.296, issue.2, pp.365-375, 2003.
DOI : 10.1016/S0304-3975(02)00661-8
URL : http://doi.org/10.1016/s0304-3975(02)00661-8

G. Theyssier, Captive Cellular Automata, MFCS, pp.427-438, 2004.
DOI : 10.1007/978-3-540-28629-5_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.5233

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

G. Theyssier, How Common Can Be Universality for Cellular Automata?, pp.121-132, 2005.
DOI : 10.1007/978-3-540-31856-9_10

B. Weiss, Subshifts of finite type and sofic systems, Monatshefte f???r Mathematik, vol.76, issue.5, pp.462-474, 1973.
DOI : 10.1007/BF01295322

S. Wolfram, Computation theory of cellular automata, Communications in Mathematical Physics, vol.30, issue.1, pp.15-57, 1984.
DOI : 10.1007/BF01217347