On Words with the Zero Palindromic Defect
classification
🧮 math.CO
keywords
wordsrichdefectpalindromiczerocannotdescriptionfactorial
read the original abstract
We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors of a longer rich word.
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.