Language Recognition by Reversible Partitioned Cellular Automata
We investigate the language accepting capability of one-dimensional reversible partitioned cellular automata (RPCAs). It is well known that bounded cellular automata (CAs) are equivalent to deterministic linear-bounded automata (DLBAs) in their language accepting capability. Here, we prove RPCAs are also equivalent to them by showing a construction method of an RPCA that simulates a given DLBA. Thus, the reversibility constraint does not decrease the ability of PCAs.
This work was supported by JSPS KAKENHI Grant Number 24500017.
- 7.Morita, K., Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata. Trans. IEICE Jpn. E72, 758–762 (1989)Google Scholar