2000 character limit reached
On the least number of palindromes contained in an infinite word
Published 15 Jan 2013 in cs.DM, cs.FL, and math.CO | (1301.3376v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.