Episturmian words are a suitable generalization to arbitrary alphabets of
Sturmian words. In this paper we are interested in the problem of enumerating
the palindromes in all episturmian words over a $k$-letter alphabet $A\_k$. We
give a formula for …
Originally introduced and studied by the third and fourth authors together with
J. Justin and S. Widmer (2008), rich words constitute a new class of finite and
infinite words characterized by containing the maximal number of distinct …
In this paper we investigate the periodic structure of rich words (i.e., words
having the highest possible number of palindromic factors), giving new results
relating them with periodic-like words. In particular, some new
characterizations of …
In this paper we prove that for any infinite word *w* whose set of
factors is closed under reversal, the following conditions are
equivalent:
1. all complete returns to palindromes are palindromes;
2. *P* (*n*) + *P* (*n*+1) = *C* (*n*+1) …
We study some structural and combinatorial properties of Sturmian palindromes,
i.e., palindromic finite factors of Sturmian words. In particular, we give a
formula which permits to compute in an exact way the number of Sturmian
palindromes of …
We study some structural and combinatorial properties of Sturmian palindromes,
i.e., palindromic finite factors of Sturmian words. In particular, we give a
formula which permits to compute in an exact way the number of Sturmian
palindromes of …