On the Palindromic Complexity of Words by Substitution of Letter Power in Modulo-recurrent WordsK. Ernest Bognini, Moussa Barro and Boucaré KientégaApplications of stable cellular automata on Sturmian wordsMoussa Barro, K. Ernest Bognini and Boucaré KientégaOn the study of cellular automata on modulo-recurrent wordsK. Ernest Bognini, Moussa Barro and Boucaré KientégaCombinatorics on words obtaining by k to k substitution and k to k exchange of a letter on modulo-recurrent wordsMoussa Barro, K. Ernest Bognini and Théodore TapsobaSQUARE COMPLETION OPERATION OF MAXIMAL SUFFIX IN FIBONACCI WORDK. Ernest Bognini, Idrissa Kaboré, B. Thomas Ouédraogo |