Palindromes in infinite ternary words
L'ubomíra Balková, Edita Pelantová, Štěpán Starosta (2009)
RAIRO - Theoretical Informatics and Applications
Similarity:
We study infinite words over an alphabet satisfying the property , where denotes the number of palindromic factors of length occurring in the language of . We study also infinite words satisfying a stronger property : every palindrome of has exactly one palindromic extension in . For binary words, the properties and coincide and these properties characterize Sturmian words, i.e., words with the complexity + 1 for any . In this paper, we focus on ternary infinite...