On the palindromic decomposition of binary words
From MaRDI portal
Publication:4820798
zbMath1064.68078arXiv1004.1278MaRDI QIDQ4820798
Publication date: 1 October 2004
Full work available at URL: https://arxiv.org/abs/1004.1278
Related Items (6)
Diverse Palindromic Factorization Is NP-complete ⋮ EERTREE: an efficient data structure for processing palindromes in strings ⋮ On palindromic factorization of words ⋮ Smallest and Largest Block Palindrome Factorizations ⋮ Diverse Palindromic Factorization is NP-Complete ⋮ Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study
This page was built for publication: On the palindromic decomposition of binary words