Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
We say x {0, 1, 2}N is a word with Sturmian erasures if for any a {0, 1, 2} the word obtained erasing all a in x is a Sturmian word. A large family of such words is given coding ...
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 t...