The Constant of Recognizability is Computable for Primitive Morphisms

Fabien Durand (1) , Julien Leroy (2)

1 LAMFA - Laboratoire Amiénois de Mathématique Fondamentale et Appliquée
2 UMONS - University of Mons [Belgium]

Mossé 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 using only the cardinality of the alphabet and the length of the longest image of a letter under the morphism. 1 J. Leroy is an FNRS post-doctoral fellow.

Domaines: Mathématiques [math]; Combinatoire [math.CO]

Fabien Durand, Julien Leroy. The Constant of Recognizability is Computable for Primitive Morphisms. Journal of Integer Sequences, 2017. ⟨hal-02455378⟩