Closed Ziv-Lempel factorization of the m-bonacci words

DOI10.1016/J.TCS.2022.03.019MaRDI QIDQ2136272zbMATH OpenOpenAlexWikidataFDO

Authors Marieh Jahannia, Morteza Mohammad-Noori, Narad Rampersad, 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

Fibonacci wordclosedepisturmian wordsZiv-Lempel factorization\(m\)-bonacci words

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words
• Open and closed words
• On the number of closed factors in a word
• Open and Closed Prefixes of Sturmian Words
• Open and closed factors in Arnoux-Rauzy words

Cites work

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

Cited in

(2)

• Closed Ziv-Lempel factorization of the $m$-bonacci words
• Asymptotic bounds for the number of closed and privileged words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136272)