Toggle navigation
Enseignants
Publications
Laboratoires
Equipes
Equipements
Valorisations
Partenariats
Connexion
Combinatorics on words obtaining by k to k substitution and k to k exchange of a letter on modulo-recurrent words
Enseignant:
BOGNINI K. Ernest
Statut:
Achevé
Details:
t. We introduce two new concepts which are the k to k substitution and k to k exchange of a letter on infinite words. After studying the return words and the special factors of words obtaining by these applications on Sturmian words and modulo-recurrent words. Next, we establish the complexity functions of these words. Finally, we determine the palindromic complexity of these words.
Mots clés :
: Sturmian words, modulo-recursive, k to k substitution, k to k exchange, complexity function, palindrome
Retour
962
Enseignants
5577
Publications
49
Laboratoires
84
Projets