The constant of recognizability is computable for primitive morphisms
Discrete Mathematics
2016-10-19 v1 Combinatorics
Abstract
Moss\'e proved that primitive morphisms are recognizable. In this paper we give a computable upper bound for the constant of recognizability of such a morphism. This bound can be expressed only using the cardinality of the alphabet and the length of the longest image under the morphism of a letter.
Cite
@article{arxiv.1610.05577,
title = {The constant of recognizability is computable for primitive morphisms},
author = {Fabien Durand and Julien Leroy},
journal= {arXiv preprint arXiv:1610.05577},
year = {2016}
}