The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold

2023/10/10 by James D. Currie, Narad Rampersad, Currie, James +1
Computer Science · #68R15 #Algorithms and Data Compression #Coding theory and cryptography #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2310.07010

openalex publication_date 2023/10/10 · openalex created_date 2023/10/13 · openalex updated_date 2026/07/28

Abstract

We find the lexicographically least infinite binary rich word having critical exponent 2+√(2)/2

Related

• Fewest repetitions in infinite binary words
• Critical exponent of binary words with few distinct palindromes
• The repetition threshold for ternary rich words
• Critical exponent of ternary words with few distinct palindromes
• Repetition Threshold for Binary Automatic Sequences