2021/06/06 by Marieh Jahannia, Jahannia, Marieh, Morteza Mohammad-Noori +5 · 1 citation
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #Rings, Modules, and Algebras #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2106.03202
openalex publication_date 2021/06/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A word w is said to be closed if it has a proper factor x which occurs exactly twice in w, as a prefix and as a suffix of w. Based on the concept of Ziv-Lempel factorization, we define the closed z-factorization of finite and infinite words. Then we find the closed z-factorization of the infinite m-bonacci words for all m ≥ 2. We also classify closed prefixes of the infinite m-bonacci words.