On dynamical complexity of surjective ultimately right-expansive cellular automata

DOI10.1007/978-3-319-92675-9_5zbMath1458.37020OpenAlexW2803422692WikidataQ62045870 ScholiaQ62045870MaRDI QIDQ1656687

Jarkko Kari, Joonatan Jalonen

Publication date: 10 August 2018

Full work available at URL: https://hal.inria.fr/hal-01824870/file/469010_1_En_5_Chapter.pdf

zbMATH Keywords

chain transitivitycellular automata over full shiftschain-recurrence assumptionnon-sofic trace

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20)

Related Items (3)

Rapid left expansivity, a commonality between Wolfram's rule 30 and powers of \(p/q\) ⋮ On the trace subshifts of fractional multiplication automata ⋮ Expansive automata networks

Cites Work

• Unnamed Item
• Unnamed Item
• The 4-way deterministic tiling problem is undecidable
• Rice's theorem for the limit sets of cellular automata
• Dynamical properties of expansive one-sided cellular automata
• Expansive invertible onesided cellular automata
• Some sofic shifts cannot commute with nonwandering shifts of finite type
• The dynamics of expansive invertible onesided cellular automata
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Condition for injectivity of global maps for tessellation automata
• Languages, equicontinuity and attractors in cellular automata
• Textile systems for endomorphisms and automorphisms of the shift
• An Introduction to Symbolic Dynamics and Coding
• Conjugacy of One-Dimensional One-Sided Cellular Automata is Undecidable
• Textile systems and one-sided resolving automorphisms and endomorphisms of the shift

This page was built for publication: On dynamical complexity of surjective ultimately right-expansive cellular automata