Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates

2018 ◽  
Vol 113 ◽  
pp. 209-220 ◽  
Author(s):  
Eurico L.P. Ruivo ◽  
Marco Montalva-Medel ◽  
Pedro P.B. de Oliveira ◽  
Kévin Perrot
2019 ◽  
Vol 19 (1) ◽  
pp. 51-90 ◽  
Author(s):  
Kévin Perrot ◽  
Marco Montalva-Medel ◽  
Pedro P. B. de Oliveira ◽  
Eurico L. P. Ruivo

2020 ◽  
Vol 274 ◽  
pp. 104538
Author(s):  
Eurico L.P. Ruivo ◽  
Pedro Paulo Balbi ◽  
Marco Montalva-Medel ◽  
Kévin Perrot

2010 ◽  
Vol 19 (3) ◽  
pp. 243-262
Author(s):  
Jiang Zhisong ◽  
◽  
Qin Dakang ◽  

2010 ◽  
Vol 88 (2) ◽  
pp. 239-248
Author(s):  
J. Escuadra Burrieza ◽  
A. Martín del Rey ◽  
J. L. Pérez Iglesias ◽  
G. Rodríguez Sánchez ◽  
A. Queiruga Dios ◽  
...  

2014 ◽  
Vol 24 (09) ◽  
pp. 1450116 ◽  
Author(s):  
Shigeru Ninagawa ◽  
Andrew Adamatzky ◽  
Ramón Alonso-Sanz

We study elementary cellular automata with memory. The memory is a weighted function averaged over cell states in a time interval, with a varying factor which determines how strongly a cell's previous states contribute to the cell's present state. We classify selected cell-state transition functions based on Lempel–Ziv compressibility of space-time automaton configurations generated by these functions and the spectral analysis of their transitory behavior. We focus on rules 18, 22, and 54 because they exhibit the most intriguing behavior, including computational universality. We show that a complex behavior is observed near the nonmonotonous transition to null behavior (rules 18 and 54) or during the monotonic transition from chaotic to periodic behavior (rule 22).


Sign in / Sign up

Export Citation Format

Share Document