Abstract
We bring out some similarities among one-dimensional surjective cellular automata. Four main results are the following: (i) all periodic points of a cellular automata are shift-periodic if and only if the set of periodic points of any fixed period is finite, (ii) forward recurrent points as well as backward recurrent points are residual for every onto cellular automata, (iii) every onto cellular automata is semi-open, and (iv) all transitive cellular automata are weak mixing and hence maximally sensitive (which improves an existing result).
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.
