Recognizability of morphisms
Dynamical Systems
2022-10-18 v3 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.2110.10267,
title = {Recognizability of morphisms},
author = {Marie-Pierre Béal and Dominique Perrin and Antonio Restivo},
journal= {arXiv preprint arXiv:2110.10267},
year = {2022}
}