We study a problem of finding universal one-dimensional reversible (injective) cellular automata (RCAs) with a small number of states. We first give a 36-state universal RCA that operates on an infinite configuration that can simulate any cyclic tag system (CTAG). We then give a 98-state model that operates on a finite configuration and can also manage halting of a CTAG.
CITATION STYLE
Morita, K. (2017). One-Dimensional Universal Reversible Cellular Automata (pp. 299–329). https://doi.org/10.1007/978-4-431-56606-9_11
Mendeley helps you to discover research relevant for your work.