Elementary Probabilistic Cellular Automata with Memory in Cells
Standard Cellular Automata (CA) are memoryless: i.e., the new state of a cell depends on the neighborhood configuration only at the preceding time step. This article considers an extension to the standard framework of CA by implementing memory capabilities in cells. Thus in CA with memory : while the update rules remain unaltered, historic memory of past iterations is retained by featuring each cell by a summary of all its past states. A study is made of the effect of historic memory on two given sides of the hypercube of elementary probabilistic CA.
KeywordsCellular Automaton Cellular Automaton Legal Rule Asymptotic Density Memory Factor
Unable to display preview. Download preview PDF.