Representation of reversible cellular automata with block permutations
- 143 Downloads
We demonstrate the structural invertibility of all reversible one- and two-dimensional cellular automata. More precisely, we prove that every reversible two-dimensional cellular automaton can be expressed as a combination of four block permutations, and some shift-like mappings. Block permutations are very simple functions that uniformly divide configurations into rectangular regions of equal size and apply a fixed permutation on all regions.
KeywordsCellular Automaton Cellular Automaton Representation Theorem Block Code Symbolic Dynamic
Unable to display preview. Download preview PDF.
- M. Boyle, Symbolic dynamics and matrices, inCombinatorial and Graph-Theoretical Problems in Linear Algebra, IMA Volumes in Mathematics and Its Applications, Vol. 50, Academic Press, New York, 1993, pp. 1–38.Google Scholar
- T. Toffoli and N. Margolus,Cellular Automata Machines, MIT Press, Cambridge, Massachusetts, 1987.Google Scholar