Year: 2013
Type: preprint
Abstract: A cellular automaton with $n$ states may be used for construction of reversible second-order cellular automaton with $n^2$ states. Reversible cellular automata with hidden parameters discussed in this paper are generalization of such construction and may have number of states $N=n m$ with arbitrary $m$. Further modification produces reversible cellular automata with reduced number of states $N' < N = n m$.
Source: arXiv (Cornell University)
Author: Vlasov, Alexander Yu.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2403786636