2018/08/07 by Jeffrey Shallit, Shallit, Jeffrey, Ramin Zarifi +1 · 1 citation
Computer Science · #Authorship Attribution and Profiling #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Natural Language Processing Techniques #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1808.02529
openalex publication_date 2018/08/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove various results about the largest exponent of a repetition in a factor of the Thue-Morse word, when that factor is considered as a circular word. Our results confirm and generalize previous results of Fitzpatrick and Aberkane & Currie.