Displaying similar documents to “Polynomial complexity of the Gilman-Maskit discreteness algorithm.”

Some algorithms to compute the conjugates of episturmian morphisms

Gwenael Richomme (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Episturmian morphisms generalize sturmian morphisms. They are defined as compositions of exchange morphisms and two particular morphisms L , and 𝔻 . Epistandard morphisms are the morphisms obtained without considering 𝔻 . In [14], a general study of these morphims and of conjugacy of morphisms is given. Here, given a decomposition of an Episturmian morphism f over exchange morphisms and { L , 𝔻 } , we consider two problems: how to compute a decomposition of one conjugate of f ; how to compute a list...