Counting the palstars

From MaRDI portal
(Redirected from Publication:405318)



Abstract: A palstar (after Knuth, Morris, and Pratt) is a concatenation of even-length palindromes. We show that, asymptotically, there are Theta(alphakn) palstars of length 2n over a k-letter alphabet, where alphak is a constant such that 2k−1<alphak<2k−1over2. In particular, alpha2doteq3.33513193.


Summary: A palstar is a concatenation of even-length palindromes. We show that, asymptotically, there are \(\Theta(\alpha_k^n)\) palstars of length \(2n\) over a \(k\)-letter alphabet, where \(\alpha_k\) is a constant such that \(2k-1 \alpha_k 2k-{1 \over 2}\). In particular, \(\alpha_2\doteq 3.33513193\).











This page was built for publication: Counting the palstars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405318)