Abstract
More than one third of the 88 globally-independent Cellular Automata rules exhibit robust simple Bernoulli-shift dynamics. Among them we find rule [Formula: see text], which we proved to be chaotic in the previous episodes of our chronicle, and rule [Formula: see text], the famous global majority rule. Therefore, we cannot overstate the importance of the Bernoulli στ-shift rules which we will present in two parts of our continuing odyssey on the Nonlinear Dynamics Perspective of Cellular Automata. This paper covers the first 15 of the 30 Bernoulli στ-shift rules. In this paper, after recalling the main concepts of Bernoulli rules — such as the role of the three Bernoulli parameters σ, τ and β — we will display the basin tree diagrams of these rules together with a convenient summary of the results extracted from them. Then, we will show that the superstring [Formula: see text] is an excellent testing signal to find the robust behavior of a given rule. Finally, we will conclude this paper with a discussion about the difference between robust and nonrobust ω-limit orbits of the Bernoulli στ-shift rules.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
