On the dynamics of cellular automata with memory

Martinez, G. J., Adamatzky, A. and Alonso-Sanz, R. (2015) On the dynamics of cellular automata with memory. Fundamenta Informaticae, 138 (1-2). pp. 1-16. ISSN 0169-2968 Available from: http://eprints.uwe.ac.uk/26445

Full text not available from this repository

Publisher's URL: http://dx.doi.org/10.3233/FI-2015-1194


Elementary cellular automata ECA are linear arrays of finite-state machines cells which take binary states, and update their states simultaneously depending on states of their closest neighbours. We design and study ECA with memory ECAM, where every cell remembers its states during some fixed period of evolution. We characterize complexity of ECAM in a case study of rule 126, and then provide detailed behavioural classification of ECAM. We show that by enriching ECA with memory we can achieve transitions between the classes of behavioural complexity. We also show that memory helps to 'discover' hidden information and behaviour on trivial uniform, periodic, and non-trivial chaotic, complex dynamical systems.

Item Type:Article
Uncontrolled Keywords:uniform, periodic, and non-trivial chaotic, complex dynamical systems
Faculty/Department:Faculty of Environment and Technology > Department of Computer Science and Creative Technologies
ID Code:26445
Deposited By: Professor A. Adamatzky
Deposited On:25 Aug 2015 13:55
Last Modified:19 Sep 2016 19:25

Request a change to this item