. John-von-neumann, Cerebral Mechanisms in Behavior, chapitre The General and Logical Theory of Automata, pp.1-41, 1951.

F. Edgar and . Codd, Cellular Automata, 1968.

C. G. Langton, Self-reproduction in cellular automata, Physica D: Nonlinear Phenomena, vol.10, issue.1-2, pp.135-144, 1984.
DOI : 10.1016/0167-2789(84)90256-2
URL : http://deepblue.lib.umich.edu/bitstream/2027.42/24968/1/0000395.pdf

K. Zuse, Rechnender raum, Elektronische Datenverarbeitung, vol.8, pp.336-344, 1967.
DOI : 10.1007/978-3-663-02723-2

M. Gardner, Mathematical Games, Scientific American, vol.223, issue.4, pp.120-123, 1970.
DOI : 10.1038/scientificamerican1070-120

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

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

F. Fagnani and L. Margara, Expansivity, Permutivity, and Chaos for Cellular Automata, Theory of Computing Systems, pp.31663-677, 1998.
DOI : 10.1007/s002240000108

G. Manzini and L. Margara, A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m, Theoretical Computer Science, vol.221, pp.157-177, 1999.
DOI : 10.1007/3-540-63165-8_232

A. Dennunzio, P. Di-lena, E. Formenti, and L. Margara, Classification of directional dynamics for additive cellular automata, Durand [139], pp.40-53
URL : https://hal.archives-ouvertes.fr/hal-00273932

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, Reversibility of 2D cellular automata is undecidable, Physica D: Nonlinear Phenomena, vol.45, issue.1-3, pp.379-385, 1990.
DOI : 10.1016/0167-2789(90)90195-U

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

K. ?ulik, I. , and S. Yu, Undecidability of cellular automata classification schemes, Complex Systems, vol.2, pp.177-190, 1988.

K. W. 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

J. Delvenne, P. K?rka, and V. Blondel, Decidability and universality in symbolic dynamical systems, Fundamenta Informaticae, vol.XX, pp.1-25, 2005.

P. Di, L. , and L. Margara, Computational complexity of dynamical systems : the case of cellular automata, 1 st International Conference on Languages, Automata Theory and Applications (LATA'07), 2007.

E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways for your mathematical plays, 1982.

C. Patrick and . Fischer, Generation of primes by a one-dimensional real-time iterative array, Journal of the American Mathematical Society, vol.12, issue.3, pp.388-394, 1965.

A. Smith and I. , 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

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

F. Edward and . Moore, The firing squad synchronisation problem, éditeur : Sequential machines, pp.213-214, 1964.

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

R. Edwin and . Banks, Universality in cellular automata, Symposium on Switching and Automata Theory, IEEE, pp.194-215, 1970.

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

B. Martin and I. , 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. Durand and Z. Róka, The Game of Life: Universality Revisited, Cellular automata, pp.51-74, 1996.
DOI : 10.1007/978-94-015-9153-9_2

J. Mazoyer and I. Rapaport, Inducing an order on cellular automata by a grouping operation, th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), volume 1373 de Lecture Notes in Computer Science, pp.15-116, 1998.

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

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

H. Poincaré, Sur le problème des trois corps et les équations de la dynamique, Acta Mathematicae, vol.13, pp.1-270, 1890.

K. ?ulik, 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

M. Hurley, Attractors in cellular automata Ergodic Theory & Dynamical Systems, pp.131-140, 1990.

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

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

M. Sablik, Étude de l'action conjointe d'un automate cellulaire et du décalage : une approche topologique et ergodique, Thèse de doctorat, 2006.

P. K?rka, Simplicity criteria for dynamical systems. Habilitation, 1993.

J. Hadamard, Les surfaces à courbures opposées et leurs lignes géodésiques, Journal de Mathématiques Pures et Appliquées, vol.4, pp.27-73, 1898.

M. Morse and G. A. Hedlund, Symbolic Dynamics, American Journal of Mathematics, vol.60, issue.4, pp.815-866, 1938.
DOI : 10.2307/2371264

D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302

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

F. Blanchard and A. Maass, Dynamical behaviour of Coven's aperiodic cellular automata, Theoretical Computer Science, vol.163, issue.1-2, pp.391-302, 1996.
DOI : 10.1016/0304-3975(96)00018-7

F. Blanchard and A. Maass, Dynamical properties of expansive one-sided cellular automata, Israel Journal of Mathematics, vol.114, issue.1, pp.149-174, 1997.
DOI : 10.1007/BF02760680

P. Di and L. , On computing the topological entropy of one-sided cellular automata, Journal of Cellular Automata, vol.2, pp.121-130, 2007.

P. Di, L. Navarro, L. E. Bertossi, and Y. Kohayakawa, Decidable properties for regular cellular automata, th IFIP International Conference on Theoretical Computer Science (TCS'06), volume 209 de International Federation for Information Processing, pp.185-196, 2006.

G. Cattaneo, E. Formenti, L. Margara, and G. Mauri, On the dynamical behavior of chaotic cellular automata, Theoretical Computer Science, vol.217, issue.1, pp.31-51, 1999.
DOI : 10.1016/S0304-3975(98)00149-2

G. Cattaneo, E. Formenti, L. Margara, and J. Mazoyer, A shiftinvariant metric on S ? inducing a non-trivial topology, éditeurs : 22 nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97), volume 1295 de Lecture Notes in Computer Science, pp.179-188, 1997.

F. Blanchard, E. Formenti, and P. K?rka, Cellular automata in the Cantor, Besicovitch and Weyl topological spaces, Complex Systems, vol.11, issue.2, pp.107-123, 1999.

P. Guillon and G. Richard, Nilpotency and Limit Sets of Cellular Automata, Edward Ochma?ski et Jerzy Tyszkiewicz, éditeurs : 33 rd International Symposium on the Mathematical Foundations of Computer Science (MFCS'08), pp.375-386, 2008.
DOI : 10.1007/978-3-540-85238-4_30
URL : https://hal.archives-ouvertes.fr/hal-00620283

J. Cervelle, E. Formenti, and P. Guillon, Sofic trace of a cellular automaton Benedikt Löwe et Andrea Sorbi, éditeurs : Computation and Logic in the Real World, rd Conference on Computability in Europe (CiE07), volume 4497 de Lecture Notes in Computer Science, pp.152-161, 2007.

J. Cervelle and P. Guillon, Towards a Rice Theorem on Traces of Cellular Automata, Ludek Ku?era et Antonín Ku?era, éditeurs : 32 nd International Symposium on the Mathematical Foundations of Computer Science, pp.310-319, 2007.
DOI : 10.1007/978-3-540-74456-6_29
URL : https://hal.archives-ouvertes.fr/hal-00620284

E. Akin, The General Topology of Dynamical Systems, volume 1 de Graduate Studies in Mathematics, 1993.

S. Louis, . Block, and A. William, Coppel : Dynamics in One Dimension, volume 1513 de Lecture Notes in Mathematics, 1991.

W. Helbig, G. , and G. A. Hedlund, Topological dynamics, volume 36 de Colloquium Publications, 1955.

I. Rapaport, Inducing an order on cellular automata by a grouping operation, Thèse de doctorat, 1997.

P. K?rka, Simulation in dynamical systems and Turing machines. brouillon, 1993.

P. K?rka, Universal computation in dynamical systems. brouillon, 1993.

M. Nasu, Textile systems for endomorphisms and automorphisms of the shift, Memoirs of the American Mathematical Society, vol.114, issue.546, 1995.
DOI : 10.1090/memo/0546

I. Putnam, Topological orbit equivalence In Operator Algebras, Mathematical Physics and Low Dimensional Topology, 1993.

G. Cattaneo, A. Dennunzio, and F. Farina, A survey on transitivity in discrete time dynamical systems. application to symbolic systems and related languages, RAIRO - Theoretical Informatics and Applications, vol.40, issue.2, pp.333-352, 2006.
DOI : 10.1051/ita:2006016

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

L. Acerbi, A. Dennunzio, and E. Formenti, Shifting and Lifting of Cellular Automata
DOI : 10.1007/978-3-540-73001-9_1
URL : https://hal.archives-ouvertes.fr/hal-00310523

F. Botelho and M. H. Garzon, Boolean neural nets are observable, Theoretical Computer Science, vol.134, issue.1, pp.51-61, 1994.
DOI : 10.1016/0304-3975(94)90277-1

M. Sablik and G. Theyssier, Topological dynamics of 2D cellular automata Costas Dimitracopoulos et Benedikt Löwe, éditeurs : Logic and Theory of Algorithms, th Conference on Computability in Europe (CiE'08), 2008.

P. K?rka, Topological dynamics of cellular automata éditeurs : Codes, Systems and Graphical Models, de IMA volumes in Mathematics and its Applications, pp.447-486, 2001.

J. Cervelle, Complexité dynamique et algorithmique des automates cellulaires. Habilitation à diriger des recherches, 2007.

R. Adler, A. Konheim, and M. Mcandrew, Topological entropy. Transactions of the, pp.309-319, 1965.

B. Balcar and P. Simon, Handbook of Boolean Algebras, chapitre Appendix on general topology, page 1241, 1989.

H. Wang, Proving Theorems by Pattern Recognition - II, Bell System Technical Journal, vol.40, issue.1, pp.1-41, 1961.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

T. Ceccherini-silberstein and M. Coornaert, A generalization of the Curtis???Hedlund theorem, Theoretical Computer Science, vol.400, issue.1-3, pp.225-229, 2008.
DOI : 10.1016/j.tcs.2008.02.050
URL : https://hal.archives-ouvertes.fr/hal-00282171

N. Jonoska and B. Marcus, Minimal presentations for irreducible sofic shifts, IEEE Transactions on Information Theory, vol.40, issue.6, pp.1818-1825, 1994.
DOI : 10.1109/18.340457

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

D. Giammarresi and A. Restivo, Ambiguity and complementation in recognizable twodimensional languages, th IFIP International Conference on Theoretical Computer Science (TCS'08), volume 273 de International Federation for Information Processing, pp.5-20, 2008.

T. K. Subrahmonian and . Moothathu, Studies in Topological Dynamics with Emphasis on Cellular Automata, Thèse de doctorat, 2006.

P. Walters, The Structure of Attractors in Dynamical Systems, volume 668 de Lecture Notes in Mathematics, chapitre On the pseudo orbit tracing property and its relationship to stability, pp.231-244, 1978.

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

J. Durand-lose, Intrinsic universality of a 1-dimensional reversible Cellular Automaton, Rüdiger Reischuk et Michel Morvan th Annual Symposium on Theoretical Aspects of Computer Science (STACS'97), volume 1200 de Lecture Notes in Computer Science, pp.14-439, 1997.
DOI : 10.1007/BFb0023479

P. K?rka, Zero-Dimensional Dynamical Systems, Formal Languages, and Universality, Theory of Computing Systems, pp.423-433, 1999.
DOI : 10.1007/s002240000124

N. Ollinger, Universalities in cellular automata, a (short) survey, Durand [139], pp.102-118
URL : https://hal.archives-ouvertes.fr/hal-00271840

P. Di, L. , and L. Margara, Row subshifts and topological entropy of cellular automata, Journal of Cellular Automata, vol.2, pp.131-140, 2007.

G. Theyssier, Amalgamation of cellular automata, Durand [139], pp.182-194
URL : https://hal.archives-ouvertes.fr/hal-00273999

R. H. Gilman, Notes on cellular automata. manuscript, 1988.

E. Coven, Topological entropy of block maps, Proceedings of the American Mathematical Society, vol.78, issue.4, pp.590-594, 1980.
DOI : 10.1090/S0002-9939-1980-0556638-1

P. Di and L. , Extensions of regular endomorphisms of shift spaces. brouillon, 2007.

E. Formenti, De l'algorithmique du chaos dans les systèmes dynamiques discrets. Habilitation à diriger des recherches, 2002.

C. Moore, Unpredictability and undecidability in dynamical systems, Physical Review Letters, vol.64, issue.20, pp.2354-2357, 1990.
DOI : 10.1103/PhysRevLett.64.2354

P. K?rka, On topological dynamics of Turing machines, Theoretical Computer Science, vol.174, issue.1-2, pp.203-216, 1997.
DOI : 10.1016/S0304-3975(96)00025-4

A. Gajardo, Sofic one-head machines, Durand [139], pp.54-64
URL : https://hal.archives-ouvertes.fr/hal-00273938

A. Gajardo and J. Mazoyer, One Head Machines from a symbolic approach, Theoretical Computer Science, vol.370, issue.1-3, pp.34-47, 2007.
DOI : 10.1016/j.tcs.2006.10.004

A. Maass, On the sofic limit sets of cellular automata, Ergodic Theory and Dynamical Systems, vol.1, issue.04, pp.663-684, 1995.
DOI : 10.1007/BF01295322

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

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

G. Richard, Rule 110 : Universality and catenations, Durand [139], pp.141-160
URL : https://hal.archives-ouvertes.fr/hal-00273995

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

T. K. Subrahmonian and . Moothathu, Homogeneity of surjective cellular automata. Discrete & Continuous Dynamical Systems, pp.195-202, 2005.

F. Fiorenzi, The Garden of Eden theorem for sofic shifts, Pure Mathematics and Applications, vol.11, issue.3, pp.471-484, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00619607

B. Durand, Automates cellulaires : réversibilité et complexité, Thèse de doctorat, 1994.

B. Durand, Global Properties of Cellular Automata, Eric Goles et Servet Martinez, éditeurs : Cellular Automata and Complex Systems. Kluwer, 1998.
DOI : 10.1007/978-94-015-9223-9_1

S. Amoroso and Y. N. , 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. Czeizler-et-jarkko-kari-giuseppe, F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata, Luís Caires, éditeurs : 32 nd International Colloquium on Automata, Languages and Programming (ICALP'05), pp.410-420, 2005.
DOI : 10.1007/11523468_34

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

B. Codenotti and L. Margara, Transitive Cellular Automata are Sensitive, The American Mathematical Monthly, vol.103, issue.1, pp.58-62, 1996.
DOI : 10.2307/2975215

V. Bernardi, Lois de conservation sur automates cellulaires, Thèse de doctorat, 2007.

F. Blanchard and P. Tisseur, Some properties of cellular automata with equicontinuity points. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, pp.569-582, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00000924

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

J. Banks, Regular periodic decompositions for topologically transitive maps. Ergodic Theory and Dynamical Systems, pp.505-529, 1997.

J. Kari, Undecidable properties of the dynamics of one-dimensional cellular automata, Durand [139], pp.3-14
URL : https://hal.archives-ouvertes.fr/hal-00274009

M. Nasu, The dynamics of expansive invertible onesided cellular automata. Transactions of the, pp.4067-4084, 2002.

F. Blanchard, J. Cervelle, and E. Formenti, Some results about the chaotic behavior of cellular automata, Theoretical Computer Science, vol.349, issue.3, pp.318-336, 2005.
DOI : 10.1016/j.tcs.2005.06.038
URL : https://hal.archives-ouvertes.fr/hal-00619713

M. Nasu, Textile systems and onesided resolving automorphisms and endomorphisms of the shift, Ergodic Theory & Dynamical Systems, vol.28, issue.2, pp.167-209, 1999.

E. Formenti and P. K?rka, Subshift attractors of cellular automata, Nonlinearity, vol.20, issue.1, pp.105-117, 2007.
DOI : 10.1088/0951-7715/20/1/007
URL : https://hal.archives-ouvertes.fr/hal-00311968

F. Blanchard, Cellular Automata and Transducers. A Topological View, Cellular Automata , Dynamical Systems and Neural Networks. Kluwer, 1994.
DOI : 10.1007/978-94-017-1005-3_1

L. Bienvenu and M. Sablik, The Dynamics of Cellular Automata in Shift-Invariant Topologies, Tero Harju, Juhani Karhumäki et Arto Lepistö, éditeurs : 11 th Conference on Development in Language Theory (DLT'07), volume 4588 de Lecture Notes in Computer Science, pp.84-95, 2007.
DOI : 10.1007/978-3-540-73208-2_11

J. Milnor, On the entropy geometry of cellular automata, Complex Systems, vol.2, issue.3, pp.357-385, 1988.

A. Dennunzio, P. Guillon, and B. Masson, Topological properties of sand automata as cellular automata, Durand [139], pp.216-227
URL : https://hal.archives-ouvertes.fr/hal-00274003

M. Pivato, K?rka's classifications of cellular automata

P. Di and L. , Decidable and Computational properties of Cellular Automata, Thèse de doctorat, 2006.

R. Berger, The undecidability of the domino problem. Memoirs of the, p.72, 1966.

B. Durand, E. Formenti, and G. Varouchas, On undecidability of equicontinuity classification for cellular automata, Michel Morvan et Éric Rémila, éditeurs : Discrete Models for Complex Systems (DMCS'03), volume AB de DMTCS Proc, pp.117-128, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01183309

J. Kari and V. Lukkarila, Some undecidable problems for one-dimensional reversible cellular automata. brouillon, décembre, 2007.

J. Kari and N. Ollinger, Periodicity and Immortality in Reversible Computing, Edward Ochma?ski et Jerzy Tyszkiewicz, éditeurs : 33 rd International Symposium on Mathematical Foundations of Computer Science (MFCS'08), pp.419-430, 2008.
DOI : 10.1007/978-3-540-85238-4_34
URL : https://hal.archives-ouvertes.fr/hal-00270815

N. Ollinger, The Intrinsic Universality Problem of One-Dimensional Cellular Automata, Helmut Alt et Michel Habib, éditeurs : 20 th Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), volume 2607 de Lecture Notes in Computer Science, pp.632-641, 2003.
DOI : 10.1007/3-540-36494-3_55

J. Cervelle and B. Durand, Tilings: recursivity and regularity, Theoretical Computer Science, vol.310, issue.1-3, pp.469-477, 2004.
DOI : 10.1016/S0304-3975(03)00242-1
URL : https://hal.archives-ouvertes.fr/hal-00619517

J. Cervelle, Complexité structurelle et algorithmique des pavages et des automates cellulaires, Thèse de doctorat, 2002.

J. Delvenne and V. Blondel, Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines, Theoretical Computer Science, vol.319, issue.1-3, pp.127-143, 2004.
DOI : 10.1016/j.tcs.2004.02.018

J. Delvenne, Dynamics, Information and Computation, Thèse de doctorat, 2005.

G. Lafitte, J. Michael-weiss-ausiello, G. Karhumäki, L. Mauri, and . Ong, Computability of Tilings, th IFIP International Conference on Theoretical Computer Science (TCS'08), volume 273 de International Federation for Information Processing, pp.187-201, 2008.
DOI : 10.1007/978-0-387-09680-3_13

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

A. Kazda, The chain relation in sofic subshifts, Workshop on Symbolic Dynamics and Coding, 2007.

J. Simonsen, On the computability of the topological entropy of subshifts
URL : https://hal.archives-ouvertes.fr/hal-00961115

K. ?ulik, I. , L. P. Hurd, and J. Kari, The topological entropy of cellular automata is uncomputable. Ergodic Theory and Dynamical Systems, pp.255-265, 1992.

K. W. Sutner, Cellular automata and intermediate reachability problems, Fundamenta Informaticae, vol.52, issue.1-3, pp.249-256, 2002.

J. Delvenne, P. K?rka, and V. Blondel, Computational Universality in Symbolic Dynamical Systems, Maurice Margenstern, éditeur : 4 th International Conference on Machines, Computations, and Universality, pp.104-115, 2005.
DOI : 10.1007/978-3-540-31834-7_8

. Shin-'ichirou and . Ishii, Measure theoretic approach to the classification of cellular automata, Discrete Applied Mathematics, vol.39, issue.2, pp.125-136, 1992.