Palindromic subsequences in finite words
From MaRDI portal
Publication:2278299
DOI10.1007/978-3-030-13435-8_34zbMath1425.68334arXiv1901.07502OpenAlexW2963247376MaRDI QIDQ2278299
Andrew Ryzhikov, Clemens Müllner
Publication date: 4 December 2019
Full work available at URL: https://arxiv.org/abs/1901.07502
Related Items (2)
Upper bounds for the necklace folding problems ⋮ On longest palindromic subwords of finite binary words
This page was built for publication: Palindromic subsequences in finite words