Toggle navigation
Enseignants
Publications
Laboratoires
Equipes
Equipements
Valorisations
Partenariats
Connexion
Applications of cellular automata on Sturmian words
Enseignant:
BOGNINI K. Ernest
Statut:
En cours
Details:
In this paper, we generalize the study of some class of cellular automata (CA) preserving stability called stable cellular automata (SCA) on Sturmian words. After establishing classic complexity of obtained words by these SCA, their special factors are also deter-mined. Next, we prove that their palindromic complexity is 1 or 2. Finally, we show that these words are α-balanced and establish their abelian complexity.
Mots clés :
stable cellular automata (SCA), modulo-recurrence, Sturmian words, complexity, special factor
Retour
962
Enseignants
5577
Publications
49
Laboratoires
84
Projets