, Structural aspects of tilings, 25th International Symposium on Theoretical Aspects of Computer Science Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.61-72, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00145800
, Logical Reversibility of Computation, IBM Journal of Research and Development, vol.17, issue.6, pp.525-532, 1973.
DOI : 10.1147/rd.176.0525
, Limit Sets of Stable and Unstable Cellular Automata, In: Fundam. Inform, vol.110, pp.1-4, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01281010
, On the Limit Sets of Cellular Automata, SIAM Journal on Computing, vol.18, issue.4, pp.831-842, 1989.
DOI : 10.1137/0218057
, ? 0 1 classes in mathematics, Handbook of Recursive Mathematics - Studies in Logic and the Foundations of Mathematics, pp.623-821, 1998.
, 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
, Revisiting the Rice Theorem of Cellular Automata, LIPIcs. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.441-452, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455736
, The undecidability of the Turing machine immortality problem, Journal of Symbolic Logic 31, pp.219-234, 1966.
DOI : 10.2307/1970290
, Formal Language Characterization of Cellular Automaton Limit Sets, In: Complex Systems, vol.1, issue.1, pp.69-80, 1987.
, Nonrecursive Cellular Automata Invariant Sets, Complex Systems, vol.42, pp.131-138, 1990.
, Recursive Cellular Automata Invariant Sets, Complex Systems, vol.42, pp.131-138, 1990.
, Degrees of members of ? 0 1 classes
, Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp.490-501, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00690285
, Turing degrees of multidimensional {SFTs} Theory and Applications of Models of Computation, Theoretical Computer Science 505, pp.81-92, 2011.
, Snakes and Cellular Automata: Reductions and Inseparability Results In: Computer Science ? Theory and Applications, Lecture Notes in Computer Science, vol.6651, pp.223-232, 2011.
, Reversibility of 2D cellular automata is undecidable, Physica D: Nonlinear Phenomena, vol.451, issue.3, pp.379-385, 1990.
, The Nilpotency Problem of One-Dimensional Cellular Automata, SIAM Journal on Computing, vol.21, issue.3, pp.571-586, 1992.
DOI : 10.1137/0221036
, 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
, 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
, Classical descriptive set theory Graduate Texts in Mathematics, p.402, 1995.
, Periodicity and Immortality in Reversible Computing, Mathematical Foundations of Computer Science Ed. by E. Ochma?ski and J. Tyszkiewicz. Lecture Notes in Computer Science, vol.5162, pp.419-430, 2008.
DOI : 10.1007/978-3-540-85238-4_34
URL : https://hal.archives-ouvertes.fr/hal-00270815
, Undecidable Properties of Limit Set Dynamics of Cellular Automata, 26th International Symposium on Theoretical Aspects of Computer Science Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, pp.337-348, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359623
, On the sofic limit sets of cellular automata, Ergodic Theory and Dynamical Systems, pp.663-684, 1995.
, Finite entropy for multidimensional cellular automata, Ergodic Theory and Dynamical Systems, pp.1243-1260, 2008.
DOI : 10.1016/S0022-0000(05)80025-X
, Mass problems associated with effectively closed sets, Tohoku Mathematical Journal, vol.634, pp.489-517, 2011.