Elementary Cellular Automata with Elementary Memory Rules in Cells: The Case of Linear Rules
Ramon Alonso-Sanz and Margarita Martin
Standard Cellular Automata (CA) rules depend on the neighborhood configuration only at the preceding time step. This article considers an extension to the standard framework of CA which implements memory capabilities by featuring each cell by elementary rules of its last three states. A study is made of the effect of memory rules on the elementary linear (or additive) CA rules 90 and 150.