Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T04:40:43.986Z Has data issue: false hasContentIssue false

Some algorithms to compute the conjugates of Episturmian morphisms

Published online by Cambridge University Press:  15 November 2003

Gwenael Richomme*
Affiliation:
LaRIA, Université de Picardie Jules Verne, 5 rue du Moulin Neuf, 80000 Amiens, France; richomme@laria.u-picardie.fr.
Get access

Abstract

Episturmian morphisms generalize Sturmian morphisms. They are definedas compositions of exchange morphisms and two particular morphismsL, and R. Epistandard morphisms are the morphisms obtained withoutconsidering R. In [14], a general study of these morphimsand 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 computea 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 thatsome 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.

Information

Type
Research Article
Copyright
© EDP Sciences, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable