The emergence of dynamical complexity: An exploration using elementary cellular automata

Complexity ◽  
2004 ◽  
Vol 9 (6) ◽  
pp. 33-42 ◽  
Author(s):  
Eduardo Mizraji
Keyword(s):  
Cellular Automata ◽  
Dynamical Complexity ◽  
Elementary Cellular Automata

The Fixed String of Elementary Cellular Automata

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

scholarly journals Cryptographic properties of Boolean functions defining elementary cellular automata

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 ◽  
...  
Keyword(s):  
Cellular Automata ◽  
Boolean Functions ◽  
Elementary Cellular Automata

Phase Transition in Elementary Cellular Automata with Memory

2014 ◽  
Vol 24 (09) ◽  
pp. 1450116 ◽  
Author(s):  
Shigeru Ninagawa ◽  
Andrew Adamatzky ◽  
Ramón Alonso-Sanz
Keyword(s):  
Cellular Automata ◽  
State Transition ◽  
Time Interval ◽  
Complex Behavior ◽  
Weighted Function ◽  
Transition Functions ◽  
Elementary Cellular Automata ◽  
Computational Universality ◽  
With Memory ◽  
Time Automaton

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).

Multifractal properties of elementary cellular automata in a discrete wavelet approach of MF-DFA

2009 ◽  
Vol 87 (2) ◽  
pp. 28003 ◽  
Author(s):  
J. S. Murguia ◽  
J. E. Pérez-Terrazas ◽  
H. C. Rosu
Keyword(s):  
Cellular Automata ◽  
Discrete Wavelet ◽  
Elementary Cellular Automata

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
Keyword(s):  
Cellular Automata ◽  
Maximum Sensitivity ◽  
Elementary Cellular Automata
Sign in / Sign up

Export Citation Format

Share Document