L. Acerbi, A. Dennunzio, and E. Formenti, Conservation of some dynamical properties for operations on cellular automata, Theoretical Computer Science, vol.410, issue.38-40, pp.3685-3693, 2009.
DOI : 10.1016/j.tcs.2009.05.004

L. Acerbi, A. Dennunzio, and E. Formenti, Surjective multidimensional cellular automata are non-wandering: A combinatorial proof, Information Processing Letters, vol.113, issue.5-6, pp.5-6156, 2013.
DOI : 10.1016/j.ipl.2012.12.009
URL : https://hal.archives-ouvertes.fr/hal-01312575

S. 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

A. Aleksandr, L. S. Andronov, and . Pontryagin, Systèmes grossiers, Dokl. Akad. Nauk. SSSR, vol.14, pp.247-250, 1937.

J. Berstel and D. Perrin, Finite and infinite words, Algebraic combinatorics on words. Cambridge, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00620767

F. Blanchard and P. Tisseur, Some properties of cellular automata with equicontinuity points Annales de l'Institut Henri Poincare (B) Probability and Statistics, pp.569-582, 2000.

N. Boccara and H. Fuk´sfuk´s, Number-conserving cellular automaton rules, Fundamenta Informaticae, vol.52, pp.1-13, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00124185

G. Cattaneo, A. Dennunzio, E. Formenti, and J. Provillard, Non-uniform Cellular Automata, LATA, pp.302-313, 2009.
DOI : 10.2307/2975324
URL : https://hal.archives-ouvertes.fr/hal-01297566

G. Cattaneo, A. Dennunzio, and L. Margara, Chaotic subshifts and related languages applications to one-dimensional cellular automata, Fundamenta Informaticae, vol.52, pp.39-80, 2002.

G. Cattaneo, A. Dennunzio, and L. Margara, Solution of some conjectures about topological properties of linear cellular automata, Theoretical Computer Science, vol.325, issue.2, pp.249-271, 2004.
DOI : 10.1016/j.tcs.2004.06.008

P. Parimal, D. R. Chaudhuri, S. Chowdhury, S. Nandi, and . Chattopadhyay, Additive Cellular Automata Theory and Applications, 1997.

B. Chopard, Cellular Automata and Lattice Boltzmann Modeling of Physical Systems, Handbook of Natural Computing, pp.287-331, 2012.
DOI : 10.1007/978-3-540-92910-9_9

A. Dennunzio, From one-dimensional to two-dimensional cellular automata, Fundamenta Informaticae, vol.115, pp.87-105, 2012.

A. Dennunzio, P. Di-lena, E. Formenti, and L. Margara, Periodic orbits and dynamical complexity in cellular automata, Fundamenta Informaticae, vol.126, pp.183-199, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01312658

A. Dennunzio, E. Formenti, and L. Manzoni, Computing issues of asynchronous ca, Fundamenta Informaticae, vol.120, issue.2, pp.165-180, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01312565

A. Dennunzio, E. Formenti, L. Manzoni, and G. Mauri, m-Asynchronous Cellular Automata, ACRI, pp.653-662, 2012.
DOI : 10.1007/978-3-642-33350-7_67
URL : https://hal.archives-ouvertes.fr/hal-01312499

A. Dennunzio, E. Formenti, L. Manzoni, and G. Mauri, m-Asynchronous cellular automata: from fairness to quasi-fairness, Natural Computing, vol.51, issue.2, pp.561-572, 2013.
DOI : 10.1007/s11047-013-9386-5
URL : https://hal.archives-ouvertes.fr/hal-01312569

A. Dennunzio, E. Formenti, and J. Provillard, Acceptance Conditions for ??-Languages, Developments in Language Theory, pp.320-331, 2012.
DOI : 10.1007/978-3-642-31653-1_29
URL : https://hal.archives-ouvertes.fr/hal-01297584

A. Dennunzio, E. Formenti, and J. Provillard, Non-uniform cellular automata: Classes, dynamics, and decidability. Information and Computation, pp.32-46, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01297590

A. Dennunzio, E. Formenti, and J. Provillard, Local rule distributions, language complexity and non-uniform cellular automata, Theoretical Computer Science, vol.504, pp.38-51, 2013.
DOI : 10.1016/j.tcs.2012.05.013
URL : https://hal.archives-ouvertes.fr/hal-01297610

A. Dennunzio, E. Formenti, and M. Weiss, Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues, Theoretical Computer Science, vol.516, pp.40-59, 2014.
DOI : 10.1016/j.tcs.2013.11.005
URL : https://hal.archives-ouvertes.fr/hal-01313574

A. Dennunzio, P. D. Lena, E. Formenti, and L. Margara, On the directional dynamics of additive cellular automata, Theoretical Computer Science, vol.410, issue.47-49, pp.4823-4833, 2009.
DOI : 10.1016/j.tcs.2009.06.023

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

B. Durand, E. Formenti, and G. Varouchas, On undecidability of equicontinuity classification for cellular automata, Discrete Models for Complex Systems, DMCS'03, volume AB of DMTCS Proceedings, pp.117-128, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01183309

F. Farina and A. Dennunzio, A predator-prey cellular automaton with parasitic interactions and environmental effects, Fundamenta Informaticae, vol.83, pp.337-353, 2008.

N. Fatès and M. Morvan, An experimental study of robustness to asynchronism for elementary cellular automata, Complex Systems, vol.16, pp.1-27, 2005.

E. Formenti, A Survey on m-Asynchronous Cellular Automata, Automata, pp.46-66, 2013.
DOI : 10.1007/978-3-642-40867-0_4
URL : https://hal.archives-ouvertes.fr/hal-01312567

E. Formenti, J. Kari, and S. Taati, On the hierarchy of conservation laws in a cellular automaton, Natural Computing, vol.97, issue.4, pp.1275-1294, 2011.
DOI : 10.1007/s11047-010-9222-0
URL : https://hal.archives-ouvertes.fr/hal-01311512

P. Gacs, Reliable computation with cellular automata, Journal of Computer and System Sciences, vol.32, issue.1, pp.15-78, 1986.
DOI : 10.1016/0022-0000(86)90002-4

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2006.

S. Huang, X. Zou, Z. Tan, and Z. Jin, Network-induced nonequilibrium phase transition in the ???game of Life???, Physical Review E, vol.67, issue.2, p.26107, 2003.
DOI : 10.1103/PhysRevE.67.026107

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, Reversible Cellular Automata, Developments in Language Theory, pp.57-68, 2005.
DOI : 10.1007/11505877_5
URL : https://hal.archives-ouvertes.fr/hal-00274009

P. K?rka, Topological and symbolic dynamics, of Cours Spécialisés. Société Mathématique de France, 2003.

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

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

G. Manzini and L. Margara, A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm, Theoretical Computer Science, vol.221, issue.1-2, pp.157-177, 1999.
DOI : 10.1016/S0304-3975(99)00031-6

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

J. Myhill, The converse of Moore???s Garden-of-Eden theorem, Proceedings of the, pp.685-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

B. Schönfisch and A. De-roos, Synchronous and asynchronous updating in cellular automata, Biosystems, vol.51, issue.3, pp.123-143, 1999.
DOI : 10.1016/S0303-2647(99)00025-8

L. Staiger and K. Wagner, Rekursive Folgenmengen I, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.22, issue.31-36, pp.31-36523, 1978.
DOI : 10.1002/malq.19780243107

K. Sutner, De Bruijn graphs and linear cellular automata, Complex Systems, vol.5, pp.19-30, 1991.