We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
ONE-DIMENSIONAL r=2 CELLULAR AUTOMATA WITH MEMORY.
- Authors
Alonso-Sanz, Ramón
- 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 remains the same, each site remembers a weighted mean of all its past states, with a decreasing weight of states farther in the past. The historic weighting is defined by a geometric series of coefficients based on a memory factor (α). This paper considers the time evolution of one-dimensional range-two CA with memory.
- Subjects
CELLULAR automata; SEQUENTIAL machine theory; MEMORY; PATTERN recognition systems; MACHINE theory; PATTERN perception
- Publication
International Journal of Bifurcation & Chaos in Applied Sciences & Engineering, 2004, Vol 14, Issue 9, p3217
- ISSN
0218-1274
- Publication type
Article
- DOI
10.1142/S0218127404011338