arXiv subjects

K. Ernest Bognini

Publications and source records attributed to K. Ernest Bognini.

3 recordsLinked to original sources

arXiv2025

On the study of cellular automata on modulo-recurrent words

In this paper, we study a class of cellular automata (CA) called stable cellular automata (SCA) that preserve stability by reflection, modulo-recurrent, and richness. After applying these automata to Sturmian words, we determine some of their combinatorial properties. Next, we calculate the classical and palindromic complexity functions of these words. Finally, we demonstrate that these words are $2$-balanced and establish their abelian complexity function.

math.CO↗

arXiv2025

A new factorization of the generalized period-doubling sequences through kernel words and gaps sequences

In this paper, we study some new factorizations of period-doubling sequences over a $k$-letter alphabet, where $k\geq 2$. First, we define the combinatorial and arithmetic properties of these sequences. Then, we define the kernel words of period-doubling sequences and demonstrate how to factorize a binary sequence using its kernel words. Next, we define gap sequences for period-doubling sequences and explore their relationship with kernel words. Lastly, we present a factorization of period-doubling sequences for $k\geq 3$ based on kernel words and gap sequences.

math.CO↗

arXiv2024

On the generalization of the study of a letter power substitution on modulo-recurrent words

Let us consider an infinite word and $k\geq 1$ an integer. By steps of $k$, we substitute a letter ofthis infinite word by the power of an external letter. The new word obtaining by this process is called $k$ to $k$ substitution of a power letter. After the application of this new notion on modulo-reccurent words and in particular on Sturmian words. We establish the complexity function of those words.

math.CO↗