2021/10/19 by Marie-Pierre Béal, Béal, Marie-Pierre, Dominique Perrin +3
Computer Science · Mathematics · #Cellular Automata and Applications #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Mathematical Dynamics and Fractals #semigroups and automata theory
paper · doi:10.48550/arxiv.2110.10267
openalex publication_date 2021/10/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We 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 non primitive morphisms due to Berthé et al. We actually prove the result of Berthé 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.