Palindromic Ziv-Lempel and Crochemore Factorizations of $m$-Bonacci Infinite Words
Discrete Mathematics
2019-05-07 v1 Formal Languages and Automata Theory
Combinatorics
Abstract
We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all -bonacci words.
Keywords
Cite
@article{arxiv.1905.01340,
title = {Palindromic Ziv-Lempel and Crochemore Factorizations of $m$-Bonacci Infinite Words},
author = {Marieh Jahannia and Morteza Mohammad-noori and Narad Rampersad and Manon Stipulanti},
journal= {arXiv preprint arXiv:1905.01340},
year = {2019}
}
Comments
34 pages