The network view of cellular automata focuses on the effective relationships between cells rather than the states themselves. In this article, we review a network representation presented in previous papers and present network graphs derived from all independent rules of one-dimensional elementary cellular automata and totalistic five-neighbor cellular automata. Removal of the transient effects of initial configurations improves the visibility of the dynamical characteristics of each rule. Power-law distributions of lifetimes and sizes of avalanches caused by one-cell perturbations of an attractor are exhibited by the derived network of Rule 11 (or 52) of totalistic five-neighbor cellular automata. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kayama, Y. (2012). Network view of binary cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 224–233). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_23
Mendeley helps you to discover research relevant for your work.