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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have