Abstract
A cellular automaton (CA) is reversible if it repeats its configuration in a cycle. Reversible one-dimensional CA are studied as automorphisms of the shift dynamical system, and analyses using graph-theoretical approaches and with block permutations. Reversible CA are dynamical systems which conserve their initial information. This is why they pose a particular interest in mathematics, coding and cryptography.
Sign-in/Register to access full text options 
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.
