On different generalizations of episturmian words

In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R is replaced by an arbitrary involutory antimorphism of the free monoid A. In particular, we define the class of -words with seed, whose "standard" elements (-standard words with seed) are constructed by an iterative -palindrome closure process, starting from a finite word u0 called the seed. When the seed is empty, one obtains -words; episturmian words are exactly the R-words. One of the main theorems of the paper characterizes -words with seed as infinite words closed under and having at most one left special factor of each length n N (where N is some nonnegative integer depending on the word). When N = 0 we call such words -episturmian. Further results on the structure of -episturmian words are proved. In particular, some relationships between -words (with or without seed) and -episturmian wor...

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni
• Keywords: Episturmian Words, Infinite Words, Seed, TCS 2008, Theoretical Computer Science