Skip to Main content Skip to Navigation
Conference papers

Representing Reversible Cellular Automata with Reversible Block Cellular Automata

Abstract : Cellular automata are mappings over infinite lattices such that each cell is updated according tothe states around it and a unique local function.Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks.We prove that any d-dimensional reversible cellular automaton can be exp ressed as thecomposition of d+1 block permutations.We built a simulation in linear time of reversible cellular automata by reversible block cellular automata (also known as partitioning CA and CA with the Margolus neighborhood) which is valid for both finite and infinite configurations. This proves a 1990 conjecture by Toffoli and Margolus (Physica D 45) improved by Kari in 1996 (Mathematical System Theory 29).
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 6, 2015 - 2:40:34 PM
Last modification on : Monday, October 12, 2020 - 10:30:28 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:45:44 AM


Publisher files allowed on an open archive


  • HAL Id : hal-01182977, version 1



Jérôme Durand-Lose. Representing Reversible Cellular Automata with Reversible Block Cellular Automata. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.145-154. ⟨hal-01182977⟩



Record views


Files downloads