Recognizability of morphisms

DOI10.1017/ETDS.2022.109MaRDI QIDQ6068415zbMATH OpenOpenAlexFDO

Authors Marie-Pierre Béal, Dominique Perrin, 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

automatasubstitutionssymbolic dynamics

Mathematics Subject Classification ID

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

Abstract: We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss'e's theorem and actually of a generalization to non primitive morphisms due to Berth'e et al. We actually prove the result of Berth'e et al. for the most general class of morphisms, including ones with erasable letters. It is derived from a result concerning elementary morphisms for which we also provide a new proof. We also show how to decide whether an injective morphism is recognizable on the full shift for aperiodic points.

Recommendations

• Recognizability for sequences of morphisms
• The constant of recognizability is computable for primitive morphisms
• Periodicity of morphic words
• Decidability of periodicity for infinite words
• On the periodicity of morphic words

Cites work

• A defect theorem for bi-infinite words.
• An introduction to symbolic dynamics and coding
• Aperiodic substitution systems and their Bratteli diagrams
• Codes and automata.
• Dimension groups and dynamical systems. Substitutions, Bratteli diagrams and Cantor systems
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• scientific article; zbMATH DE number 6498000 (Why is no real title available?)
• scientific article; zbMATH DE number 3641729 (Why is no real title available?)
• scientific article; zbMATH DE number 2042127 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• Interplay between finite topological rank minimal Cantor systems, S-adic subshifts and their complexity
• Minimal flows arising from substitutions of non-constant length
• Nonperiodicity implies unique composition for self-similar translationally finite tilings
• On a question of McNaughton and Papert
• On syntactic groups.
• Power of words and recognizability of fixpoints of a substitution
• Recognizability for sequences of morphisms
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Simulation of effective subshifts by two-dimensional subshifts of finite type
• Substitution dynamical systems. Spectral analysis
• Sur le théorème du defaut
• The decidability of the dol prefix problem
• Tilings, substitution systems and dynamical systems generated by them

Cited in

(12)

• Recognizability for sequences of morphisms
• Unambiguously coded shifts
• The Jacobs-Keane theorem from the \(\mathcal{S}\)-adic viewpoint
• Automatic abelian complexities of Parikh-collinear fixed points
• Quasi-fixed points of substitutive systems
• Various questions around finitely positively expansive dynamical systems
• On the minimal components of substitution subshifts
• Coboundaries and eigenvalues of finitary S-adic systems
• Decidability of the isomorphism problem between multidimensional substitutive subshifts
• Measure transfer and S-adic developments for subshifts
• Recognizability in S-adic shifts
• The unambiguity of segmented morphisms

This page was built for publication: Recognizability of morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6068415)