P. Guillon and G. Richard, Nilpotency and Limit Sets of Cellular Automata, MFCS (édité par Edward Ochma?ski et Jerzy Tyszkiewicz), v. 5162 de Lecture Notes in Computer Science, pp.375-386, 2008.
DOI : 10.1007/978-3-540-85238-4_30
URL : https://hal.archives-ouvertes.fr/hal-00620283

N. Ollinger and G. Richard, Collisions and their Catenations: Ultimately Periodic Tilings of the Plane, Fifth Ifip International Conference On Theoretical Computer Science ? Tcs, pp.229-240, 2008.
DOI : 10.1007/978-0-387-09680-3_16
URL : https://hal.archives-ouvertes.fr/hal-00175397

N. Ollinger and G. Richard, A particular cellular automaton. Dans The Complexity of Simple Programs, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00095821

N. Ollinger and G. Richard, Automata on the plane vs particles and collisions, Theoretical Computer Science, vol.410, issue.27-29, 2009.
DOI : 10.1016/j.tcs.2009.03.039
URL : https://hal.archives-ouvertes.fr/hal-00310960

G. Richard, Rule 110 : universality and catenations, Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires, pp.141-160, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00273995

R. Amoroso and Y. N. 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

F. Blanchard, P. K?rka, and A. Maass, Topological and measure-theoretic properties of one-dimensional cellular automata, Physica D: Nonlinear Phenomena, vol.103, issue.1-4, pp.1-4, 1997.
DOI : 10.1016/S0167-2789(96)00254-0

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, Proceedings of the International Congress on Logic, Methodology , and Philosophy of Science, pp.1-11, 1962.
DOI : 10.1007/978-1-4613-8928-6_23

A. W. Burks, Essays on Cellular Automata, 1970.

J. Cervelle, E. Formenti, and P. Guillon, Sofic trace subshift of a cellular automaton Dans CiE (édité par S, Benedikt Löwe et Andrea Sorbi), v. 4497 de Lecture Notes in Computer Science, pp.152-161, 2007.

N. Chomsky, Three models for the description of language, IEEE Transactions on Information Theory, vol.2, issue.3, pp.113-124, 1956.
DOI : 10.1109/TIT.1956.1056813

A. Church, An Unsolvable Problem of Elementary Number Theory, American Journal of Mathematics, vol.58, issue.2, pp.345-363, 1936.
DOI : 10.2307/2371045

J. Cocke and M. Minsky, Universality of Tag Systems with P = 2, Journal of the ACM, vol.11, issue.1, pp.15-20, 1964.
DOI : 10.1145/321203.321206

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

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

K. ?ulík, I. , and S. Yu, Undecidability of CA classification schemes Complex systems, pp.177-190, 1988.

J. Dubacq, B. Durand, and E. Formenti, Kolmogorov complexity and cellular automata classification, Theoretical Computer Science, vol.259, issue.1-2, pp.271-285, 2001.
DOI : 10.1016/S0304-3975(00)00012-8
URL : http://doi.org/10.1016/s0304-3975(00)00012-8

B. Durand and Z. Róka, The game of life : universality revisited. Dans Cellular Automata : a parallel model (édité par Marianne Delorme et Jacques Mazoyer, Kluwer, pp.51-76, 1999.

N. Fatès, Robustesse de la dynamique des systèmes discrets : le cas de l'asynchronisme dans les automates cellulaires, Thèse de doctorat, 2004.

J. Michael, M. O. Fischer, and . Rabin, Super-exponential complexity of Presburger arithmetic. Rapport technique, Massachusetts Institute of Technology, 1974.

C. Patrick and . Fischer, Generation of primes by a one-dimensional realtime iterative array, Journal of the ACM, v, vol.12, issue.3, pp.388-394, 1965.

N. Ganguly, B. K. Sikdar, A. Deutsch, G. Canright, and P. Chaudhuri, A survey on cellular automata. Rapport technique, 2003.

M. Gardner, Mathematical games : The fantastic combinations of John Conway's new solitaire game life, Scientific American, issue.223, pp.120-123, 1970.

D. Giammarresi and A. Restivo, Two-dimensional languages. Dans Handbook of Formal Languages (édité par Arto Salomaa et Grzegorz Rozenberg, pp.215-267, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00541890

S. Ginsburg-et-edwin and H. Spanier, Semigroups, Presburger formulas, and languages, Pacific Journal of Mathematics, vol.16, issue.2, pp.285-296, 1966.
DOI : 10.2140/pjm.1966.16.285

G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system Mathematical Systems Theory, v. 3 p, pp.320-375, 1969.

W. Hordijk, R. Cosma, J. P. Shalizi, and . 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

H. Oscar, T. Ibarra, and . Jiang, Relating the power of cellular arrays to their closure properties, Theor. Comput. Sci, pp.225-238, 1988.

J. Kari, Decision Problems Concerning Cellular Automata, Thèse de doctorat, 1990.

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, 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

J. Kari and N. Ollinger, Periodicity and Immortality in Reversible Computing, MFCS (édité par Edward Ochma?ski et Jerzy Tyszkiewicz), v. 5162 de Lecture Notes in Computer Science, pp.419-430, 2008.
DOI : 10.1007/978-3-540-85238-4_34
URL : https://hal.archives-ouvertes.fr/hal-00270815

C. Stephen and . Kleene, Representation of events in nerve nets and finite automata, Automata Studies, 1956.

T. , Y. Kong, and A. Rosenfeld, Digital Topology, The American Mathematical Monthly, vol.86, issue.8, pp.357-393, 1989.
DOI : 10.2307/2321290

I. Korec, Real-time generation of primes by a one-dimensional cellular automaton with 11 states, pp.101-116, 1998.
DOI : 10.1007/BFb0029979

P. K?rka, Topological dynamics of cellular automata, Codes, Systems, and Graphical Models (édité par Brian Marcus et Joachim Rosenthal), v. 123 de The IMA Volumes in Mathematics and its Applications, pp.447-386, 2001.

B. Martin and I. , Automates cellulaires, information et chaos, Thèse de doctorat, 2001.

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. Minsky, Computation : Finite and Infinite Machines, 1967.

F. Edward and . Moore, Machine models of self-reproduction, Proceedings of Symposia in Applied Mathematics, pp.17-33, 1962.

K. Morita, Universality of a reversible two-counter machine, Theoretical Computer Science, vol.168, issue.2, pp.303-320, 1996.
DOI : 10.1016/S0304-3975(96)00081-3

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

N. Ollinger, Automates cellulaires : structures, Thèse de doctorat, 2002.
URL : https://hal.archives-ouvertes.fr/tel-00007765

E. Post, Formal Reductions of the General Combinatorial Decision Problem, American Journal of Mathematics, vol.65, issue.2, pp.197-215, 1943.
DOI : 10.2307/2371809

I. Rapaport, Inducing an order on CA by a grouping operation, Thèse de doctorat, 1998.

R. Alvy and I. Smith, Cellular automata complexity trade-offs. Information and Control, pp.466-482, 1971.

V. Terrier, Décidabilité en arithmétiques faibles. Temps réel sur automates cellulaires, Thèse de doctorat, 1991.

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

A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265, 1936.

. John-von-neumann, Theory of Self-Reproducing Automata, 1966.

J. Watrous, On one-dimensional quantum cellular automata, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.528-537, 1995.
DOI : 10.1109/SFCS.1995.492583
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.5050

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

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

K. R. Zuse and . Raum, Elektronische Datenverarbeitung, v. 8 p, pp.336-344, 1967.