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

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), p.30, 1970.
DOI : 10.1109/SWAT.1970.27

R. Berger, The undecidability of the domino problem, Memoirs of the American Mathematical Society, vol.0, issue.66, p.37, 1966.
DOI : 10.1090/memo/0066

V. Bernardi, B. Durand, E. Formenti, K. , and J. , A new dimension sensitive property for cellular automata, In Symposium on Mathematical Foundations of Computer Science, p.37, 2004.
DOI : 10.1007/978-3-540-28629-5_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.5285

J. Berstel and D. Perrin, Theory of Codes, p.14, 1985.
URL : https://hal.archives-ouvertes.fr/hal-00619780

M. Boyle and B. Kitchens, Periodic points for onto cellular automata, Indagationes Mathematicae, vol.10, issue.4, pp.483-493, 1999.
DOI : 10.1016/S0019-3577(00)87901-X
URL : http://doi.org/10.1016/s0019-3577(00)87901-x

G. Cattaneo, E. Formenti, L. Margara, and J. Mazoyer, A new shift-invariant metric on S Z inducing a non-trivial topology, Mathematical Foundations of Computer Science (MFCS'97) {8} [11] Cattaneo, G., and Margara, L. Topological definitions of chaos applied to cellular automata dynamics. In Symposium on Mathematical Foundations of Computer Science, 1997.

J. Cervelle, Complexité structurelle et algorithmique des pavages et des automates cellulaires, p.21, 2002.

C. Choffrut, I. , and K. , On real-time cellular automata and trellis automata, Acta Informatica, vol.21, issue.4, p.53, 1984.
DOI : 10.1007/BF00264617

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

I. ?ulik, K. Pachl, J. , Y. , and S. , On the Limit Sets of Cellular Automata, SIAM Journal on Computing, vol.18, issue.4, pp.831-842, 1989.
DOI : 10.1137/0218057

B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, p.99, 2002.
DOI : 10.1017/CBO9780511809088

B. Durand, Automates cellulaires : réversibilité et complexité, p.19, 1994.

B. Durand, E. Formenti, R. , and Z. , Number-conserving cellular automata I: decidability, Theoretical Computer Science, vol.299, issue.1-3, 2003.
DOI : 10.1016/S0304-3975(02)00534-0

B. Durand, E. Formenti, and G. Varouchas, On undecidability of equicontinuity classification for cellular automata, DMCS (2003), pp.117-128
URL : https://hal.archives-ouvertes.fr/hal-01183309

B. Durand and R. , Mathematics and its Applications The game of life :universality revisited, Z. Cellular Automata : a Parallel Model, vol.460, issue.36, pp.51-74, 1999.

J. Durand-lose, Automates cellulaires, automates à partitions et tas de sable, p.44, 1996.
URL : https://hal.archives-ouvertes.fr/tel-00548830

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

C. Dürr, I. Rapaport, and G. Theyssier, Cellular automata and communication complexity, Theoretical Computer Science, vol.322, issue.2, 2004.
DOI : 10.1016/j.tcs.2004.03.017

F. Fiorenzi, Cellular automata and strongly irreducible shifts of finite type, Theoretical Computer Science, vol.299, issue.1-3, p.19, 2003.
DOI : 10.1016/S0304-3975(02)00492-9
URL : https://hal.archives-ouvertes.fr/hal-00619606

P. C. Fischer, Generation of Primes by a One-Dimensional Real-Time Iterative Array, Journal of the ACM, vol.12, issue.3, pp.388-394, 1965.
DOI : 10.1145/321281.321290

E. Formenti, Automates cellulaires et chaos : de la vision topologique à la vision algorithmique, p.64, 1998.

E. Formenti and A. Grange, Number conserving cellular automata II: dynamics, Theoretical Computer Science, vol.304, issue.1-3, p.44, 2003.
DOI : 10.1016/S0304-3975(03)00134-8
URL : http://doi.org/10.1016/s0304-3975(03)00134-8

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

M. Gromov, Endomorphisms of symbolic algebraic varieties, Journal of the European Mathematical Society, vol.1, issue.2, pp.109-197, 1999.
DOI : 10.1007/PL00011162

A. M. Harao, Computation universality of one-dimensional reversible (injective) cellular automata. The trans, pp.44-45, 1989.

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, pp.91-92, 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.

O. H. Ibarra, M. Kim, and S. Moran, Sequential Machine Characterizations of Trellis and Cellular Automata and Applications, SIAM Journal on Computing, vol.14, issue.2, p.53, 1985.
DOI : 10.1137/0214033

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

K. Imai and K. Morita, A computation-universal two-dimensional 8-state triangular reversible cellular automaton, Theoretical Computer Science, vol.231, issue.2, p.105, 2000.
DOI : 10.1016/S0304-3975(99)00099-7
URL : http://doi.org/10.1016/s0304-3975(99)00099-7

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

J. Kari, Reversibility and surjectivity problems of cellular automata, Journal of Computer and System Sciences, vol.48, issue.1, pp.149-182, 1994.
DOI : 10.1016/S0022-0000(05)80025-X

J. Kari, Rice's theorem for the limit sets of cellular automata, Theoretical Computer Science, vol.127, issue.2, pp.229-254, 1994.
DOI : 10.1016/0304-3975(94)90041-8

J. Kari and J. Kari, Representation of reversible cellular automata with block permutations, Mathematical Systems Theory, vol.98, issue.1, pp.47-61, 1996.
DOI : 10.1007/BF01201813

P. K?rka, Languages, equicontinuity and attractors in cellular automata, Ergodic Theory and Dynamical Systems, vol.17, issue.2, pp.417-433, 1997.
DOI : 10.1017/S014338579706985X

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

P. K?rka and A. Maass, Limit Sets of Cellular Automata Associated to Probability Measures, Journal of Statistical Physics, vol.100, pp.5-6, 2000.

P. K?rka and A. Maass, Realtime subshifts, Theoretical Computer Science, vol.237, issue.1-2, p.91, 2000.
DOI : 10.1016/S0304-3975(98)00192-3

P. K?rka and A. Maass, Stability of subshifts in cellular automata, Fundamenta Informaticae, vol.52, issue.13, pp.143-155, 2002.

E. Kushilevitz and N. Nisan, Communication Complexity, p.92, 1997.

G. Lafitte, Calculs et infinis, 2002.

D. Lind, M. , and B. , An introduction to symbolic dynamics and coding, pp.12-86, 1995.
DOI : 10.1017/CBO9780511626302

A. Machi and F. Mignosi, Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups, SIAM Journal on Discrete Mathematics, vol.6, issue.1, p.19, 1993.
DOI : 10.1137/0406004

B. Martin, A universal cellular automaton in quasi-linear time and its S???m???n form, Theoretical Computer Science, vol.123, issue.2, pp.199-237, 1994.
DOI : 10.1016/0304-3975(92)00076-4

B. Martin, Automates cellulaires, information et chaos, 2001.

O. Martin, A. Odlyzko, W. , and S. , Algebraic properties of cellular automata, Communications in Mathematical Physics, vol.30, issue.2, pp.219-262, 1984.
DOI : 10.1007/BF01223745

A. Maruoka and M. Kimura, Condition for injectivity of global maps for tessellation automata, Information and Control, vol.32, issue.2, pp.158-162, 1976.
DOI : 10.1016/S0019-9958(76)90195-9

J. Mazoyer, On optimal solutions to the firing squad synchronization problem, Theoretical Computer Science, vol.168, issue.2, pp.367-404, 1996.
DOI : 10.1016/S0304-3975(96)00084-9

J. Mazoyer, R. , and I. , Additive cellular automata over ???p and the bottom of (CA,???), Lecture Notes in Computer Science, pp.834-843, 1998.
DOI : 10.1007/BFb0055835

J. Mazoyer, R. , and I. , Inducing an Order on Cellular Automata by a Grouping Operation, Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science, p.25, 1998.

J. Mazoyer, R. , and I. , 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

J. Mazoyer and N. And-reimen, A linear speed-up theorem for cellular automata, Theoretical Computer Science, vol.101, issue.1, 1992.
DOI : 10.1016/0304-3975(92)90150-E

J. Mazoyer and V. Terrier, Signals in one-dimensional cellular automata, Theoretical Computer Science, vol.217, issue.1, pp.53-80, 1999.
DOI : 10.1016/S0304-3975(98)00150-9

M. L. Minsky, Computation : Finite and infinite machines, pp.35-36, 1967.

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

E. F. Moore, The firing squad synchronization problem In Sequential Machines -Selected Papers, pp.213-214, 1964.

A. Moreira, Universality and decidability of number-conserving cellular automata, Theoretical Computer Science, vol.292, issue.3, p.44, 2003.
DOI : 10.1016/S0304-3975(02)00065-8

A. Moreira, N. Boccara, and E. Goles, On conservative and monotone one-dimensional cellular automata and their particle representation, Theoretical Computer Science, vol.325, issue.2, p.44, 2004.
DOI : 10.1016/j.tcs.2004.06.010
URL : http://doi.org/10.1016/j.tcs.2004.06.010

M. Morse, Recurrent geodesics on a surface of negative curvature, Transactions of the American Mathematical Society, vol.22, issue.1, pp.84-110, 1921.
DOI : 10.1090/S0002-9947-1921-1501161-8

M. Morse, H. , and G. A. , Symbolic Dynamics, American Journal of Mathematics, vol.60, issue.4, pp.286-303, 1936.
DOI : 10.2307/2371264

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

K. Nagel and M. Schreckenberg, A cellular automaton model for freeway traffic, Journal de Physique I, vol.2, issue.12, pp.2221-2229, 1992.
DOI : 10.1051/jp1:1992277
URL : https://hal.archives-ouvertes.fr/jpa-00246697

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

M. Nivat, Transductions des langages de Chomsky, Annales de l???institut Fourier, vol.18, issue.1, pp.339-456, 1968.
DOI : 10.5802/aif.287

N. Ollinger, Automates Cellulaires : structures [74] Ollinger, N. The quest for small universal cellular automata, International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science, pp.28-30, 2002.

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

W. Parry, Intrinsic Markov chains, Transactions of the American Mathematical Society, vol.112, issue.1, pp.55-66, 1964.
DOI : 10.1090/S0002-9947-1964-0161372-1

M. Pivato, Y. , and R. , Limit measures for affine cellular automata, Ergodic Theory & Dynamical Systems, pp.1269-1287, 2002.
DOI : 10.1017/S0143385702000548

V. Poupet, Simulating 3D Cellular Automata with 2D??Cellular Automata, In Symposium on Mathematical Foundations of Computer Science, p.79, 2004.
DOI : 10.1007/978-3-540-28629-5_33

I. Rapaport, Inducing an Order on Cellular Automata by a Grouping Operation, p.89

A. Restivo, A note on renewal systems, Theoretical Computer Science, vol.94, issue.2, p.14, 1992.
DOI : 10.1016/0304-3975(92)90044-G

Z. Róka, Cellular automata on Cayley graphs, p.79, 1994.

Z. Róka, Simulations between cellular automata on cayley graphs, Theoretical Computer Science, vol.225, p.25, 1999.

I. Smith and A. R. , Real-time language recognition by one-dimensional cellular automata, Journal of Computer and System Sciences, vol.6, issue.3, pp.233-253, 1972.
DOI : 10.1016/S0022-0000(72)80004-7

K. Sutner, Classifying circular cellular automata, Physica D: Nonlinear Phenomena, vol.45, issue.1-3, p.37, 1990.
DOI : 10.1016/0167-2789(90)90196-V

V. Terrier, Language not recognizable in real time by one-way cellular automata, Theoretical Computer Science, vol.156, issue.1-2, pp.281-287, 1996.
DOI : 10.1016/0304-3975(95)00111-5

G. Theyssier, Captive Cellular Automata, Mathematical Foundations of Computer Science Lecture Notes in Computer Science, pp.427-438, 2004.
DOI : 10.1007/978-3-540-28629-5_32

G. Theyssier, How Common Can Be Universality for Cellular Automata?, Annual Symposium on Theoretical Aspects of Computer Science, p.52, 2005.
DOI : 10.1007/978-3-540-31856-9_10

P. Tisseur, Aspects ergodiques des automates cellulaires, 1999.

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. Williams, Notes on renewal systems, Proceedings of the American Mathematical Society, vol.110, issue.3, pp.851-853, 1990.
DOI : 10.1090/S0002-9939-1990-1025283-2

S. Wolfram, Universality and complexity in cellular automata, Physica D: Nonlinear Phenomena, vol.10, issue.1-2, pp.1-35, 1984.
DOI : 10.1016/0167-2789(84)90245-8

A. C. Yao, Some complexity questions related to distributive computing, ACM Symposium on Theory of Computing, p.92, 1979.