Note
Reversible simulation of one-dimensional irreversible cellular automata

https://doi.org/10.1016/0304-3975(95)00038-XGet rights and content
Under an Elsevier user license
open archive

Abstract

A cellular automaton (CA) is called reversible (or injective) iff its global function is one-to-one. It has been shown by Toffoli that any (irreversible) k-dimensional CA is simulated by a k + 1-dimensional RCA. In this paper, we show that any one-dimensional CA with finite configurations can be simulated by a one-dimensional reversible CA. This is proved by using the framework of partitioned CA (PCA).

Cited by (0)

1

Fax: +81-824-22-7195.