S. Amoroso and Y. 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. Durand-lose, Reversible cellular automaton able to simulate any other reversible one using partitioning automata, LATIN '95, number 911 in LNCS, pp.230-244, 1995.
DOI : 10.1007/3-540-59175-3_92

J. Durand-lose, Intrinsic universality of a 1-dimensional reversible Cellular Automaton, STACS '97 number 1200 in LNCS, pp.439-450, 1997.
DOI : 10.1007/BFb0023479

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, Representation of reversible cellular automata with block permutations, Mathematical Systems Theory, vol.98, issue.1, pp.47-61, 1996.
DOI : 10.1007/BF01201813

J. Kari, On the circuit depth of structurally reversible cellular automata, Fundamenta Informaticae, vol.38, issue.12, pp.93-107, 1999.

]. K. Mor95 and . Morita, Reversible simulation of one-dimensional irreversible cellular automata, Theoretical Computer Science, vol.148, pp.157-163, 1995.

N. [. Toffoli and . Margolus, Invertible cellular automata: A review, Physica D: Nonlinear Phenomena, vol.45, issue.1-3, pp.229-253, 1990.
DOI : 10.1016/0167-2789(90)90185-R