\( \omega \)-Lyndon words

DOI10.1016/J.TCS.2019.11.004zbMath1458.68153OpenAlexW2985366794MaRDI QIDQ2290620

Luca Q. Zamboni, Mickael Postic

Publication date: 29 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.11.004

zbMATH Keywords

Lyndon wordslexicographic orders

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Reprint of: ``Generalized Lyndon factorizations of infinite words ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ Generalized Lyndon factorizations of infinite words

Cites Work

• Infinite Lyndon words
• On generalized Lyndon words
• Transfinite Lyndon Words
• Lyndon factorization of infinite words
• Generalized Lyndon factorizations of infinite words

This page was built for publication: \( \omega \)-Lyndon words