Abstract
An algorithm is presented for determining reversibility characteristics of 1-dimensional cellular automaton laws. The concept of local reversibility is defined. Each locally reversible automaton is shown to be isomorphic to a member of the class of “center-reversible” automata. Algorithms are described for generating the set of center-reversible laws and the set of center-reversible additive laws.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
