Analysis of ergodic rules in one-dimensional cellular automata shows patterns in ergodicity, suggesting complexity in structures.
Exactly ergodicity in boundary-driven semi-infinite cellular automata (CA) are investigated. We establish all the ergodic rules in CA with 3, 4, and 5 states. We analytically prove the ergodicity for 18 rules in 3-state CA and 118320 rules in 5-state CA with any ergodic and periodic boundary condition, and numerically confirm all the other rules non-ergodic with some boundary condition. We classify ergodic rules into several patterns, which exhibit a variety of ergodic structure.
No takes yet. Share an insight, caveat, or question.
Shiraishi et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: