Abstract
Standard Cellular Automata (CA) are ahistoric (memoryless): i.e. the new state of a cell depends on the neighborhood configuration only at the preceding time step. This article introduces an extension to the standard framework of CA by considering automata implementing memory capabilities. While the update rules of the CA remain the same, each site remembers a weighted mean of all its past states. The historic weighting is defined by a geometric series of coefficients based on a memory factor (α). The time evolution of one-dimensional CA with memory starting with a single live cell is studied. It is found that for α ≤ 0.5, the evolution corresponds to the standard (nonweighted) one, while for α > 0.5, there is a gradual decrease in the width of the evolving pattern, apart from discontinuities which sometimes may occur for certain rules and α values.
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.
