2013/05/28 by Golnaz Badkobeh, Badkobeh, Golnaz, Gabriele Fici +3
Computer Science · #68R15 #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Natural Language Processing Techniques #semigroups and automata theory
paper · doi:10.48550/arxiv.1305.6395
openalex publication_date 2013/05/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of closed factors of words. We show that a word of length n contains at least n+1 distinct closed factors, and characterize those words having exactly n+1 closed factors. Furthermore, we show that a word of length n can contain Θ(n2) many distinct closed factors.