ON THE WORDS BY $k$ TO $k$ INSERTION OF A LETTER IN STURMIAN WORDS
Moussa Barro, I. Kabor\'{e}, Théodore Tapsoba · International Journal of Apllied Mathematics · 2017
We study the classical complexity of k to k insertion words of a letter in Sturmian words.Then, we determine the Abelian complexity and palindromic complexity of these words.Finally, we show that the k to k insertion of a letter x in Sturmian words preserves the palindromic richness of Sturmian words if and only if k = 1.