Back to Search Start Over

Lyndon factorization of the Prouhet words

Authors :
Patrice Séébold
Source :
Theoretical Computer Science. 307:179-197
Publication Year :
2003
Publisher :
Elsevier BV, 2003.

Abstract

Prouhet words are a natural generalization, over alphabets with more than two letters, of the well known binary Thue–Morse word.We give a unique factorization of these words in a sequence of decreasing Lyndon words, then generalizing such a decomposition given by Ido and Melançon for the Thue–Morse word.

Details

ISSN :
03043975
Volume :
307
Database :
OpenAIRE
Journal :
Theoretical Computer Science
Accession number :
edsair.doi.dedup.....675a221b4dae346cb5e22e6fae1a65d6
Full Text :
https://doi.org/10.1016/s0304-3975(03)00100-2