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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
