The constant of recognizability is computable for primitive morphisms

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.

[1]  Andrzej Ehrenfeucht,et al.  Simplifications of Homomorphisms , 1978, Inf. Control..

[2]  C. Mauduit,et al.  Substitutions in dynamics, arithmetics, and combinatorics , 2002 .

[3]  Petr Kůrka,et al.  Topological and symbolic dynamics , 2003 .

[4]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[5]  Nivat G. Päun,et al.  Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.

[6]  Filippo Mignosi,et al.  If a D0L Language is k-Power Free then it is Circular , 1993, ICALP.

[7]  Christian F. Skau,et al.  Substitutional dynamical systems, Bratteli diagrams and dimension groups , 1999, Ergodic Theory and Dynamical Systems.

[8]  B. Mossé.  Reconnaissabilité des substitutions et complexité des suites automatiques , 1996 .

[9]  A. Siegel,et al.  Geometric representation of substitutions of Pisot type , 2001 .

[10]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[11]  Karel Klouda,et al.  Synchronizing delay for binary uniform morphisms , 2015, Theor. Comput. Sci..

[12]  Luca Q. Zamboni,et al.  Descendants of Primitive Substitutions , 1999, Theory of Computing Systems.

[13]  Fabien Durand,et al.  A characterization of substitutive sequences using return words , 1998, Discret. Math..

[14]  Brigitte Mossé,et al.  Puissances de mots et reconnaissabilité des point fixes d'une substitution , 1992, Theor. Comput. Sci..

[15]  Michel Rigo,et al.  Asymptotic properties of free monoid morphisms , 2015, ArXiv.

[16]  M. Queffélec.  Substitution dynamical systems, spectral analysis , 1987 .

[17]  Grzegorz Rozenberg,et al.  L Systems , 1974, Handbook of Formal Languages.