Closed Ziv-Lempel factorization of the \(m\)-bonacci words

DOI10.1016/J.TCS.2022.03.019OpenAlexW3169893027WikidataQ114129128 ScholiaQ114129128MaRDI QIDQ2136272

Narad Rampersad, Morteza Mohammad-Noori, Marieh Jahannia, Manon Stipulanti

Publication date: 10 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.03202

zbMATH Keywords

episturmian wordsFibonacci wordclosedZiv-Lempel factorization\(m\)-bonacci words

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Closed factorization
• On z-factorization and c-factorization of standard episturmian words
• Infinite Lyndon words
• A characterization of substitutive sequences using return words
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Episturmian words and episturmian morphisms
• Enumeration and structure of trapezoidal words
• Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words
• The sequence of open and closed prefixes of a Sturmian word
• Some properties of the Tribonacci sequence
• Return words in Sturmian and episturmian words
• On the Number of Closed Factors in a Word
• EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
• Représentation géométrique de suites de complexité $2n+1$
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Factorizations of the Fibonacci Infinite Word
• Crochemore Factorization of Sturmian and Other Infinite Words
• Some properties of the singular words of the Fibonacci word
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Closed Ziv-Lempel factorization of the \(m\)-bonacci words