On the least number of palindromes contained in an infinite word
- Authors: Fici, G; Zamboni, L
- Publication year: 2013
- Type: Articolo in rivista (Articolo in rivista)
- OA Link: http://hdl.handle.net/10447/73727
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