On the study of cellular automata on modulo-recurrent words

MaRDI QIDQ6418481zbMATH OpenFDO

Authors Moussa Barro, K. Ernest Bognini, Boucaré Kientéga

Publication date 25 November 2022

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Combinatorics on words (68R15) Automata sequences (11B85)

Abstract: In this paper, we study some class of cellular automata (CA) preserving modulo-recursive, stability by reflection and richness called stable cellular automata (SCA). After applying these automata on Sturmian words, we establish some combinatorial properties of these new words. Next, the classical and palindromic complexity functions of these words are also determined. Finally, we show that these words are $2$-balanced and we establish their abelian complexity function.

This page was built for publication: On the study of cellular automata on modulo-recurrent words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418481)