2008/05/14 by Geneviève Paquin, Genevieve Paquin, Paquin, Genevieve · 1 citation
Computer Science · Mathematics · #Algorithms and Data Compression #Combinatorics (math.CO) #Computer science #FOS: Mathematics #Natural Language Processing Techniques #math.CO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0805.2077
published in arXiv (Cornell University) (Cornell University) · Extended version with the correct main result. There was an error in the first version
openalex publication_date 2008/05/14 · arxiv created 2009/04/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only ones? If no, what do the infinite smooth words that are also Lyndon words look like? In this paper, we give the answer, proving that the only infinite smooth Lyndon words are m_\a<b></b>