On The Least Number of Palindromes in an Infinite Word
- Authors: Fici, G; Zamboni, LQ
- Publication year: 2012
- Type: Contributo in atti di convegno pubblicato in volume
- OA Link: http://hdl.handle.net/10447/75631
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