1. Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures;Amaroso;J. Comp. Systems Sci,1972
2. Charles H. Bennett, Logical reversibility of computation, IBM J. Res. Dev., November 1973, pp. 525–532.
3. Tim Boykett, Algebraic aspects of reversible computation, Ph.D. Thesis, University of Western Australia, 1997.
4. Tim Boykett, Towards a Noether-like conservation law theorem for one dimensional reversible cellular automata, available as http://www.arxiv.org/abs/nlin.CG/0312003, 2003, submitted.
5. Tim Boykett, Cris Moore, Commuting cellular automata, Complex Systems (1997) 55–64.