Papers › On generalization of reversible second-order cellular automata
On generalization of reversible second-order cellular automata
Alexander Yu. Vlasov
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A cellular automaton with n states may be used for construction of reversible second-order cellular automaton with n² 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections