ACRI 2004: Cellular Automata pp 11-20

Elementary Probabilistic Cellular Automata with Memory in Cells

  • Ramón Alonso-Sanz
  • Margarita Martín
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3305)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ramón Alonso-Sanz
    • 1
  • Margarita Martín
    • 2
  1. 1.ETSI Agrónomos (Estadística)C.UniversitariaMadridSpain
  2. 2.Bioquímica y Biología Molecular IVUCM. C.UniversitariaMadridSpain

Personalised recommendations