The constant of recognizability is computable for primitive morphisms
classification
💻 cs.DM
math.CO
keywords
boundcomputableconstantmorphismmorphismsprimitiverecognizabilityalphabet
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.