Papers
Topics
Authors
Recent
Search
2000 character limit reached

The constant of recognizability is computable for primitive morphisms

Published 18 Oct 2016 in cs.DM and math.CO | (1610.05577v1)

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.

Citations (10)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Fabien Durand 
  2. Julien Leroy 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up