Abstract
AbstractWe investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Mossé’s theorem and actually of a generalization to a more general class of morphisms due to Berthé et al [Recognizability for sequences of morphisms. Ergod. Th. & Dynam. Sys.39(11) (2019), 2896–2931]. We actually prove the result of Berthé et al for the most general class of morphisms, including ones with erasable letters. Our result is derived from a result concerning elementary morphisms for which we also provide a new proof. We also prove some new results which allow us to formulate the property of recognizability in terms of finite automata. We use this characterization to show that for an injective morphism, the property of being recognizable on the full shift for aperiodic points is decidable.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,General Mathematics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decidable problems in substitution shifts;Journal of Computer and System Sciences;2024-08
2. Measure transfer and S-adic developments for subshifts;Ergodic Theory and Dynamical Systems;2024-03-11
3. The Jacobs–Keane theorem from the $ \mathcal{S} $-adic viewpoint;Discrete and Continuous Dynamical Systems;2024
4. Unambiguously coded shifts;European Journal of Combinatorics;2023-09
5. Automaticity and Parikh-Collinear Morphisms;Lecture Notes in Computer Science;2023