ARTICLE
Applications of stable cellular automata on Sturmian words
- MALAYA JOURNAL OF MATEMATIK , 13 (3) : 239-250
Lien de l'article :
https://doi.org/10.26637/mjm1303/002
Discipline :
Mathématiques
Auteur(s) :
Moussa Barro, K. Ernest Bognini and Boucaré Kientéga
Auteur(s) tagués :
BOGNINI K. Ernest
Renseignée par : BOGNINI K. Ernest
Résumé
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 the classic complexity of obtained words by these SCA, their special factors are also specified. 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), Strumian words, Complexity, special factor