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

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

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

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

A. Dennunzio, E. Formenti, and J. Provillard, Non-uniform cellular automata: classes, dynamics, and decidability. ArXiv e-prints, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01297590

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, DMTCS AB, pp.117-128, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01183309

A. Fúster-sabater, P. Caballero-gil, and M. Pazo-robles, Application of Linear Hybrid Cellular Automata to Stream Ciphers, Computer Aided Systems Theory ? EUROCAST 2007, pp.564-571, 2007.
DOI : 10.1007/978-3-540-75867-9_71

P. Gerlee and A. R. Anderson, Stability analysis of a hybrid cellular automaton model of cell colony growth, Physical Review E, vol.75, issue.5, p.51911, 2007.
DOI : 10.1103/PhysRevE.75.051911

G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Theory of computing systems, pp.320-375, 1969.
DOI : 10.1007/BF01691062

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

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

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

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

I. Litovsky and L. Staiger, Finite acceptance of infinite words, Theoretical Computer Science, vol.174, issue.1-2, pp.1-21, 1997.
DOI : 10.1016/S0304-3975(96)00006-0

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

E. F. Moore, Machines models of self-reproduction, Proceedings of symposia in applied mathematics 14, 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.685-686, 1963.
DOI : 10.1090/S0002-9939-1963-0155764-9

M. Nivat and D. Perrin, Ensembles reconnaissables de mots biinfinis, pp.47-59, 1982.
DOI : 10.1145/800070.802176

D. Perrin and J. E. Pin, Infinite Words, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00620767

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