Some algorithms to compute the conjugates of Episturmian morphisms

DOI10.1051/ita:2003009zbMath1084.68094MaRDI QIDQ4462680

Gwenaël Richomme

Publication date: 18 May 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_1_85_0

zbMATH Keywords

algorithms; conjugacy; Sturmian morphisms; Combinatorics on words

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

On a generalization of Christoffel words: epichristoffel words

Cites Work

• Unnamed Item
• Unnamed Item
• On the conjugation of standard morphisms
• Fibonacci morphisms and Sturmian words
• Fine and Wilf's theorem for three periods and a generalization of Sturmian words
• Conjugacy and episturmian morphisms.
• Some remarks on invertible substitutions on three letter alphabet.
• Well-balanced sequences
• Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
• Episturmian words and episturmian morphisms
• Conjugation of standard morphisms and a generalization of singular words
• Return words in Sturmian and episturmian words
• On a paper by Castelli, Mignosi, Restivo
• Représentation géométrique de suites de complexité $2n+1$
• A remark on morphic sturmian words
• Symbolic Dynamics II. Sturmian Trajectories
• Episturmian words and some constructions of de Luca and Rauzy