On generalization of reversible second-order cellular automata

2013/11/18 by Alexander Yu. Vlasov, Vlasov, Alexander Yu.
Biochemistry, Genetics and Molecular Biology · Computer Science · #Cellular Automata and Applications #Cellular Automata and Lattice Gases (nlin.CG) #Computability, Logic, AI Algorithms #DNA and Biological Computing #FOS: Computer and information sciences #FOS: Physical sciences #Formal Languages and Automata Theory (cs.FL)

paper · pdf · doi:10.48550/arxiv.1311.4297

openalex publication_date 2013/11/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related

• Two-state, Reversible, Universal Cellular Automata in Three Dimensions
• On complex dynamics from reversible cellular automata
• New aspects of symmetry of elementary cellular automata
• On number of nonzero cells in some two-dimensional reversible second-order cellular automata
• Sequentializing cellular automata