Infinite words without palindrome
classification
💻 cs.DM
keywords
factorsinfiniteclosedexistsfinitelymanyonlypalindrome
read the original abstract
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.
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.