Counting the Palstars

Electronic Journal Of Combinatorics

L. Bruce Richmond¹ 

关键词: palindrome;    palstar;    prime palstar;    bordered word;    analytic combinatorics;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A palstar (after Knuth, Morris, and Pratt) 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 <

【 授权许可】

Others