Abstract

Standard cellular automata (CA) rules depend only on the neighborhood configuration of the preceding time step. This article considers an extension to the standard CA framework which implements memory capabilities by featuring each cell with a minimal summary of its past states, the mode of the last three states in particular. A study is made on the spatio-temporal and difference patterns of one-dimensional CA.

Full Text
Paper version not known

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

Disclaimer: 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.