2000 character limit reached
Recognizability of morphisms (2110.10267v3)
Published 19 Oct 2021 in math.DS and cs.FL
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.