Abstract
Standard cellular automata (CA) are ahistoric (memoryless), i.e., the new state of a cell depends on its neighborhood configuration only at the preceding time step. Historic memory of all past iterations can be incorporated into CA by featuring each cell by a weighted mean of all its past states. In this paper, a new kind of reversible CA, which incorporates memory, is introduced in a two-dimensional scenario.
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.
