Abstract
A subshift attractor is a two-sided subshift which is an attractor of a cellular automaton. We prove that each subshift attractor is chain-mixing, contains a configuration which is both F-periodic and σ-periodic and the complement of its language is recursively enumerable. We prove that a subshift of finite type is an attractor of a cellular automaton iff it is mixing. We identify a class of chain-mixing sofic subshifts which are not subshift attractors. We construct a cellular automaton whose maximal attractor is a non-sofic mixing subshift, answering a question raised in Maass (1995 Ergod. Theory Dyn. Syst. 15 663–84). We show that a cellular automaton is surjective on its small quasi-attractor which is the non-empty intersection of all subshift attractors of all Fqσp, where q > 0 and .
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.
