Fibonacci morphisms and Sturmian words
Theoretical Computer Science
Text algorithms
Handbook of formal languages, vol. 1
On the conjugation of standard morphisms
MFCS '96 Selected papers from the 21st symposium on Mathematical foundations of computer science
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Theoretical Computer Science
Theoretical Computer Science
Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Episturmian words and episturmian morphisms
Theoretical Computer Science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Rauzy substitutions and multi-dimensional Sturmian words
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
Theoretical Computer Science
Characterizations of finite and infinite episturmian words via lexicographic orderings
European Journal of Combinatorics
A characterization of fine words over a finite alphabet
Theoretical Computer Science
On stabilizers of infinite words
Theoretical Computer Science
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
On a generalization of Christoffel words: epichristoffel words
Theoretical Computer Science
A local balance property of episturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Theoretical Computer Science
Note: Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Theoretical Computer Science
Hi-index | 5.24 |
Episturmian morphisms generalize Sturmian morphisms. Here, we study some intrinsic properties of these morphisms: invertibility, presentation, cancellativity, unitarity, characterization by conjugacy. Most of them are generalizations of known properties of Sturmian morphisms. But we present also some results on episturmian morphisms that have not already been stated in the particular case of Sturmian morphisms: characterization of the episturmian morphisms that preserve palindromes, new algorithms to compute conjugates.We also study the conjugation of morphisms in the general case and show that the monoid of invertible morphisms on an alphabet containing at least three letters is not finitely generated.