Classification of CA Rules Targeting Synthesis of Reversible Cellular Automata

This paper reports classification of CA (cellular automata) rules targeting efficient synthesis of reversible cellular automata An analytical framework is developed to explore the properties of CA rules for 3-neighborhood 1-dimensional CA It is found that in two-state 3-neighborhood CA, the CA rules fall into 6 groups depending on their potential to form reversible CA The proposed classification of CA rules enables synthesis of reversible CA in linear time.