[HTML][HTML] Palindromic Ziv–Lempel and Crochemore factorizations of m-bonacci infinite words
Theoretical Computer Science, 2019•Elsevier
… 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 m-bonacci words. … We introduce the palindromic z-factorization
p z ( w ) and palindromic c-factorization p c ( w ) by requiring that each of the factors in the
previous definitions be palindromes. That is, the …
requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci
word, and more generally, for all m-bonacci words. … We introduce the palindromic z-factorization
p z ( w ) and palindromic c-factorization p c ( w ) by requiring that each of the factors in the
previous definitions be palindromes. That is, the …
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 m-bonacci words.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果