On the least number of palindromes contained in an infinite word
arXiv:1301.3376 · doi:10.1016/j.tcs.2013.02.013
Abstract
We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then investigate the same problem when the alphabet has size two.
Accepted for publication in Theoretical Computer Science