Y. [. Amoroso and . 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. Cervelle, B. Cervelle, E. Formenti, and P. Guillon, Tilings: recursivity and regularity, Computation and Logic in the Real World, 3 rd Conference on Computability in Europe (CiE07), pp.469-477, 2004.
DOI : 10.1016/S0304-3975(03)00242-1

URL : https://hal.archives-ouvertes.fr/hal-00619517

J. Cervelle and P. Guillon, Towards a Rice Theorem on Traces of Cellular Automata, 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

I. Culík, I. Karel?ulíkkarel?karel?ulík, J. K. Pachl, S. Delvenne, and V. Blondel, On the limit sets of cellular automata Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines, SIAM Journal on Computing Theoretical Computer Science, vol.18, issue.319, pp.831-842127, 1989.

M. Delorme, E. Formenti, J. Durand, E. Formenti, and G. Varouchas, Open problems on cellular automata On undecidability of equicontinuity classification for cellular automata, Discrete Models for Complex Systems (DMCS'03), volume AB of DMTCS Proc, pp.117-128, 2000.

P. Di and L. , Decidable properties for regular cellular automata, th IFIP International Conference on Theoretical Computer Science (TCS'06), volume 209 of International Federation for Information Processing, pp.185-196, 2003.

P. Di, L. , and L. Margara, Undecidable properties of limit set dynamics of cellular automata, 26 th International Symposium on Theoretical Aspects of Computer Science (STACS'09), pp.337-348, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359623

P. Guillon and G. Richard, Nilpotency and Limit Sets of Cellular Automata, 33 rd International Symposium on the Mathematical Foundations of Computer Science Endomorphisms and automorphisms of the shift dynamical system. Mathematical Systems Theory, pp.375-386320, 1969.
DOI : 10.1007/978-3-540-85238-4_30

URL : https://hal.archives-ouvertes.fr/hal-00620283

P. Lyman and . Hurd, Formal language characterization of cellular automaton limit sets, Complex systems, vol.1, pp.69-80, 1987.

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

G. Lafitte and M. Weiss, Computability of Tilings, th IFIP International Conference on Theoretical Computer Science (TCS'08), volume 273 of International Federation for Information Processing, pp.187-201, 2008.
DOI : 10.1007/978-0-387-09680-3_13

A. Maass, On the sofic limit set of cellular automata. Ergodic Theory & Dynamical Systems, pp.663-684, 1995.

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

F. Edward and . Moore, The firing squad synchronisation problem [Pou08] Victor Poupet Translating partitioned cellular automata into classical cellular automataRic53] Henry Grodon Rice. Classes of recursively enumerable sets and their decision problems. Transactions of the, Journées Automates Cellulaires, 1 st Symposium on Cellular Automata (JAC'08), pp.213-214, 1953.