Article ID Journal Published Year Pages File Type
438379 Theoretical Computer Science 2007 8 Pages PDF
Abstract

Using the notions of conjugacy of morphisms and of morphisms preserving Lyndon words, we answer a question of G. Melançon. We characterize cases where the sequence of Lyndon words in the Lyndon factorization of a standard Sturmian word is morphic. In each possible case, the corresponding morphism is given.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics