. Br-]-r, I. Briceño, and . Rapaport, Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata (prepublication)

L. Boyer and G. Theyssier, On Factor Universality in Symbolic Spaces, MFCS, pp.209-220, 2010.
DOI : 10.1007/978-3-642-15155-2_20
URL : https://hal.archives-ouvertes.fr/hal-00474559

M. Delorme, J. Mazoyer, N. Ollinger, and G. Theyssier, Bulking I: An abstract theory of bulking, Theoretical Computer Science, vol.412, issue.30, p.451732, 2010.
DOI : 10.1016/j.tcs.2011.02.023
URL : https://hal.archives-ouvertes.fr/hal-00451732

M. Delorme, J. Mazoyer, N. Ollinger, and G. Theyssier, Bulking II: Classifications of cellular automata, Theoretical Computer Science, vol.412, issue.30, pp.3881-3905, 2011.
DOI : 10.1016/j.tcs.2011.02.024
URL : https://hal.archives-ouvertes.fr/hal-00451727

P. [. Goles, I. Meunier, G. Rapaport, and . Theyssier, Communication complexity and intrinsic universality in cellular automata, Theoretical Computer Science, vol.412, issue.1-2, 2009.
DOI : 10.1016/j.tcs.2010.10.005
URL : https://hal.archives-ouvertes.fr/hal-00440186

P. [. Guillon, G. Meunier, and . Theyssier, Clandestine simulations in cellular automata, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00541996

]. G. Hed69 and . Hedlund, Endomorphisms and automorphisms of the shift dynamical systems, Mathematical Systems Theory, vol.3, issue.4, pp.320-375, 1969.

]. U. Jun09 and . Jung, On the existence of open and bi-continuing codes, 2009.

N. [. Kushilevitz and . Nisan, Communication complexity, 1997.