Counting the Palstars
Combinatorics
2014-06-13 v2 Discrete Mathematics
Formal Languages and Automata Theory
Abstract
A palstar (after Knuth, Morris, and Pratt) is a concatenation of even-length palindromes. We show that, asymptotically, there are palstars of length over a -letter alphabet, where is a constant such that . In particular, .
Cite
@article{arxiv.1311.2318,
title = {Counting the Palstars},
author = {L. Bruce Richmond and Jeffrey Shallit},
journal= {arXiv preprint arXiv:1311.2318},
year = {2014}
}