Recognizability of morphisms

Abstract We investigate several questions related to the notion of recognizable morphism. The main result is a new proof Mossé’s theorem and actually generalization more general class morphisms due Berthé et al [Recognizability for sequences morphisms. Ergod. Th. & Dynam. Sys. 39 (11) (2019), 2896–2931]. prove most morphisms, including ones with erasable letters. Our derived from concerning elementary which we also provide proof. some results allow us formulate property recognizability in terms finite automata. use this characterization show that an injective morphism, being on full shift aperiodic points decidable.