TWO-DIMENSIONAL CELLULAR AUTOMATA WITH MEMORY: PATTERNS STARTING WITH A SINGLE SITE SEED

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. The effect of keeping ahistoric memory of all past iterations in two-dimensional CA, featuring each cell by its most frequent state is analyzed in this work.