L. Boyer, M. Delacourt, and M. Sablik, Construction of µlimit sets, Journées Automates Cellulaires, p.7687, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00542356

L. Boyer, V. Poupet, and G. Theyssier, On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures, MFCS 2006, vol.4162, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00022186

M. Delacourt, V. Poupet, M. Sablik, and G. Theyssier, Directional Dynamics along Arbitrary Curves in Cellular Automata. Theoretical Computer Science, A paraître, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00451729

H. Fredricksen and I. Kessler, Lexicographic compositions and deBruijn sequences, Journal of combinatorial theory, A, vol.22, pp.17-30, 1977.
DOI : 10.1016/0097-3165(77)90059-0
URL : https://doi.org/10.1016/0097-3165(77)90059-0

P. Guillon and G. Richard, Revisiting the Rice Theorem for Cellular Automata, STACS, p.441452, 2010.

M. Hurley, Ergodic aspects of cellular automata, Ergodic Theory Dynam. Systems, vol.10, issue.4, p.671685, 1990.

J. Kari, Rice's Theorem for the Limit Sets of Cellular Automata, Theor. Comput. Sci, vol.127, issue.2, p.229254, 1994.

K. Petr, A. Urka, and . Maass, Limit sets of cellular automata associated to probability measures, Journal of Statistical Physics, vol.100, issue.5, p.10311047, 2000.

. Henry-gordon-rice, Classes of recursively enumerable sets and their decision problems, Transactions of the American Mathematical Society, vol.74, issue.2, pp.358-366, 1953.

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

, If there exists an algorithm that determines if the µ-limit set of a given CA has property P, we apply it on CA B 0 and B 1. If the algorithm gives dierent answers for both CA, necessarily we have case 1 and H is µ-nilpotent. If on the other hand

, Therefore, we have an algorithm to determine if a CA is µ-nilpotent