Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words
From MaRDI portal
Publication:2272382
DOI10.1016/j.tcs.2019.05.010zbMath1436.68281arXiv1905.01340WikidataQ114129166 ScholiaQ114129166MaRDI QIDQ2272382
Narad Rampersad, Morteza Mohammad-Noori, Manon Stipulanti, Marieh Jahannia
Publication date: 10 September 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.01340
Sturmian words; episturmian words; palindrome; Fibonacci word; Crochemore factorization; Ziv-Lempel factorization; \(m\)-bonacci word
68R15: Combinatorics on words
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On z-factorization and c-factorization of standard episturmian words
- Lyndon words and singular factors of sturmian words
- Episturmian words and episturmian morphisms
- Palindrome complexity.
- Some properties of the Tribonacci sequence
- The Lempel–Ziv Complexity of Fixed Points of Morphisms
- On the Complexity of Finite Sequences
- Factorizations of the Fibonacci Infinite Word
- Crochemore Factorization of Sturmian and Other Infinite Words
- Some properties of the singular words of the Fibonacci word