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 …
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 …