S. Abramsky, A structural approach to reversible computation, Theoretical Computer Science, vol.347, issue.3, pp.441-464, 2005.
DOI : 10.1016/j.tcs.2005.07.002

D. Angluin, Inference of Reversible Languages, Journal of the ACM, vol.29, issue.3, pp.741-765, 1982.
DOI : 10.1145/322326.322334

C. H. Bennett, Logical Reversibility of Computation, IBM Journal of Research and Development, vol.17, issue.6, pp.525-532, 1973.
DOI : 10.1147/rd.176.0525

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

A. Kondacs and J. Watrous, On the power of quantum finite state automata, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.66-75, 1997.
DOI : 10.1109/SFCS.1997.646094

M. Kutrib and A. Malcher, Fast reversible language recognition using cellular automata, Information and Computation, vol.206, issue.9-10, pp.9-10, 2008.
DOI : 10.1016/j.ic.2008.03.015
URL : https://doi.org/10.1016/j.ic.2008.03.015

M. Kutrib and A. Malcher, Real-time reversible iterative arrays, Theoretical Computer Science, vol.411, issue.4-5, pp.812-822, 2010.
DOI : 10.1016/j.tcs.2009.10.017

M. Kutrib and A. Malcher, Reversible pushdown automata, Journal of Computer and System Sciences, vol.78, issue.6, pp.1814-1827, 2012.
DOI : 10.1016/j.jcss.2011.12.004

M. Kutrib and A. Malcher, One-way reversible multi-head finite automata, Theor. Comput. Sci

M. Kutrib, A. Malcher, and M. Wendlandt, Real-Time Reversible One-Way Cellular Automata, Cellular Automata and Discrete Complex Systems, pp.56-69, 2014.
DOI : 10.1007/978-3-319-18812-6_5

M. Kutrib, A. Malcher, and M. Wendlandt, Reversible queue automata. Fund, Inform, vol.14834, pp.341-368, 2016.

R. Landauer, Irreversibility and Heat Generation in the Computing Process, IBM Journal of Research and Development, vol.5, issue.3, pp.183-191, 1961.
DOI : 10.1147/rd.53.0183

K. J. Lange, P. Mckenzie, and A. Tapp, Reversible Space Equals Deterministic Space, Journal of Computer and System Sciences, vol.60, issue.2, pp.354-367, 2000.
DOI : 10.1006/jcss.1999.1672

K. Morita, Computation-universality of one-dimensional one-way reversible cellular automata, Information Processing Letters, vol.42, issue.6, pp.325-329, 1992.
DOI : 10.1016/0020-0190(92)90231-J

K. Morita, Reversible simulation of one-dimensional irreversible cellular automata, Theoretical Computer Science, vol.148, issue.1, pp.157-163, 1995.
DOI : 10.1016/0304-3975(95)00038-X

K. Morita, Reversible computing and cellular automata???A survey, Theoretical Computer Science, vol.395, issue.1, pp.101-131, 2008.
DOI : 10.1016/j.tcs.2008.01.041

K. Morita, Two-way reversible multi-head finite automata, Fund. Inform, vol.110, pp.241-254, 2011.

K. Morita, Language Recognition by Reversible Partitioned Cellular Automata, LNCS, vol.8996, pp.106-120, 2014.
DOI : 10.1007/978-3-319-18812-6_9

K. Morita and M. Harao, Computation universality of one dimensional reversible injective cellular automata, IEICE Trans. Inf. Syst, vol.721, pp.758-762, 1989.

J. E. Pin, On reversible automata, Theoretical Informatics, pp.401-416, 1992.
DOI : 10.1007/BFb0023844
URL : https://hal.archives-ouvertes.fr/hal-00019977

T. Toffoli, Computation and construction universality of reversible cellular automata, Journal of Computer and System Sciences, vol.15, issue.2, pp.213-231, 1977.
DOI : 10.1016/S0022-0000(77)80007-X