On the least number of palindromes contained in an infinite word
classification
💻 cs.DM
cs.FLmath.CO
keywords
factorsinfiniteinvestigateleastnumberproblemwordalphabet
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.