2000 character limit reached
The constant of recognizability is computable for primitive morphisms (1610.05577v1)
Published 18 Oct 2016 in cs.DM and math.CO
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.