Issue |
RAIRO-Theor. Inf. Appl.
Volume 37, Number 1, January/March 2003
|
|
---|---|---|
Page(s) | 85 - 104 | |
DOI | https://doi.org/10.1051/ita:2003009 | |
Published online | 15 November 2003 |
Some algorithms to compute the conjugates of Episturmian morphisms
LaRIA, Université de Picardie Jules Verne, 5 rue du Moulin Neuf,
80000 Amiens, France; richomme@laria.u-picardie.fr.
Received:
October
2002
Accepted:
January
2003
Episturmian morphisms generalize Sturmian morphisms. They are defined as compositions of exchange morphisms and two particular morphisms L, and R. Epistandard morphisms are the morphisms obtained without considering R. 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,R}, we consider two problems: how to compute a decomposition of one conjugate of f; how to compute a list of decompositions of all the conjugates of f when f is epistandard. For each problem, we give several algorithms. Although the proposed methods are fundamently different, we show that some of these lead to the same result. We also give other algorithms, using the same input, to compute for instance the length of the morphism, or its number of conjugates.
Mathematics Subject Classification: 68R15
Key words: Combinatorics on words / Sturmian morphisms / conjugacy / algorithms.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.