Recognizability of morphisms

DOI10.1017/etds.2022.109arXiv2110.10267OpenAlexW3205986289MaRDI QIDQ6068415

Dominique Perrin, Marie-Pierre Béal, Antonio Restivo

Publication date: 15 December 2023

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.10267

zbMATH Keywords

automatasymbolic dynamicssubstitutions

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulation of effective subshifts by two-dimensional subshifts of finite type
• Substitution dynamical systems. Spectral analysis
• Sur le théorème du defaut
• Power of words and recognizability of fixpoints of a substitution
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• Nonperiodicity implies unique composition for self-similar translationally finite tilings
• On syntactic groups.
• Tilings, substitution systems and dynamical systems generated by them
• A defect theorem for bi-infinite words.
• Aperiodic substitution systems and their Bratteli diagrams
• The decidability of the dol prefix problem
• Reconnaissabilité des substitutions et complexité des suites automatiques
• On a question of McNaughton and Papert
• Dimension Groups and Dynamical Systems
• An Introduction to Symbolic Dynamics and Coding
• Recognizability for sequences of morphisms
• Minimal flows arising from substitutions of non-constant length
• Interplay between finite topological rank minimal Cantor systems, 𝒮-adic subshifts and their complexity

This page was built for publication: Recognizability of morphisms