Because of their simplicity, rules of cellular automata can easily be understood. In a very simple version, we consider two-state one-dimensional cellular automata (CA) made of identical cells with a periodic boundary condition. In this case, the object of study is a ring of coupled cells with L = I + 1 cells, labeled consecutively from i = 0 to i=I.
Boolean Function Cellular Automaton Cellular Automaton Nonlinear Differential Equation Truth Table
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.
L.O. Chua, S. Yoon, R. Dogaru, A nonlinear dynamics perspective of Wolfram’s new kind of science Part I: Threshold of complexity. Int. J. Bifurcation Chaos (IJBC) 12(12), 2655–2766 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
L.O. Chua, V.I. Sbitnev, S. Yoon, A nonlinear dynamics perspective of Wolfram’s new kind of science Part II: Universal neuron. Int. J. Bifurcation Chaos (IJBC) 13(9), 2377–2491 (2003)MathSciNetzbMATHCrossRefGoogle Scholar