Affiliation:
1. Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA 94720, USA
2. Cellular Sensory and Wave Computing Laboratory, Computer and Automation Research Institute – MTA-SZTAKI and Pazmany University, Budapest, Hungary
Abstract
Over the past eight years, we have studied one of the simplest, yet extremely interesting, dynamical systems; namely, the one-dimensional binary Cellular Automata. The most remarkable results have been presented in a series of papers which is concluded by the present article. The final stop of our odyssey is devoted to the analysis of the second half of the 30 Bernoulli στ-shift rules, which constitute the largest among the six groups in which we classified the 256 local rules. For all these 15 rules, we present the basin-tree diagrams obtained by using each bit string with L ≤ 8 as initial state, a summary of the characteristics of their ω-limit orbits, and the space-time patterns generated from the superstring. Also, in the last section we summarize the main results we obtained by means of our "nonlinear dynamics perspective".
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Modelling and Simulation,Engineering (miscellaneous)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献