Cover Image

On the study of cellular automata on modulo-recurrent words

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barro, Moussa, Bognini, K. Ernest, Kientéga, Boucaré
Format:	Preprint
Published:	2022
Subjects:	Combinatorics 37B15, 68Q80, 68R15, 11B85 F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the generalization of the study of a letter power substitution on modulo-recurrent words
by: Barro, Moussa, et al.
Published: (2024)

A new factorization of the generalized period-doubling sequences through kernel words and gaps sequences
by: Bognini, K. Ernest, et al.
Published: (2025)

Novel Constructions of Words with Strong Avoidance Properties and their Combinatorial Analysis
by: Abdullah, Duaa, et al.
Published: (2025)

Quasi-fixed points of substitutive systems
by: Krawczyk, Elżbieta
Published: (2024)

Automaticity of uniformly recurrent substitutive sequences
by: Krawczyk, Elżbieta, et al.
Published: (2021)

Almost Golomb Sequences
by: Cloitre, Benoit
Published: (2026)

Meta-automatic Sequences
by: Campbell, John M., et al.
Published: (2026)

Ternary cellular automata induced by semigroups of order 3 are solvable
by: Fukś, Henryk
Published: (2026)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)

Further results on generalized cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2023)

The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
by: Klouda, Karel, et al.
Published: (2021)

Multipass automata and group word problems
by: Ceccherini-Silberstein, Tullio, et al.
Published: (2014)

Applications of Combinatorics on Words with Symbolic Dynamics
by: Abdullah, Duaa, et al.
Published: (2025)

Solving the initial value problem for cellular automata by pattern decomposition
by: Fukś, Henryk
Published: (2025)

Computing Expansions in Infinitely Many Cantor Real Bases via a Single Transducer
by: Charlier, Émilie, et al.
Published: (2025)

On the Asymptotic Palindrome Density of Fibonacci Infinite Words
by: Abdullah, Duaa, et al.
Published: (2025)

Dynamic and Programmatic Analysis of Fibonacci Word Density
by: Abdullah, Duaa, et al.
Published: (2025)

Generalized Natural Density $\DF(\mathfrak{F}_n)$ of Fibonacci Word
by: Hamoud, Jasem, et al.
Published: (2025)

Improvement Ergodic Theory For The Infinite Word $\mathfrak{F}=\mathfrak{F}_{b}:=\left({ }_{b} f_{n}\right)_{n \geqslant 0}$ on Fibonacci Density
by: Hamoud, Jasem, et al.
Published: (2025)

Asymptotic Analysis of q-Recursive Sequences
by: Heuberger, Clemens, et al.
Published: (2021)

A Linear Representation for Constant Term Sequences mod $p^a$ with Applications to Uniform Recurrence
by: Kohen, Nadav
Published: (2025)

Enumeration of Factor Occurrences in $k$-Bonacci Words over an Infinite Alphabet
by: Ghareghani, Narges, et al.
Published: (2026)

Totally Greedy Sequences Defined by Second-Order Linear Recurrences With Constant Coefficients
by: Pérez-Rosés, Hebert
Published: (2024)

Using Walnut to solve problems from the OEIS
by: Bosma, Wieb, et al.
Published: (2025)

A Recursive Block Pillar Structure in the Kolakoski Sequence K(1,3)
by: Cook, William
Published: (2025)

Uniform Recurrence in the Motzkin Numbers and Related Sequences mod $p$
by: Kohen, Nadav
Published: (2024)

q-Parikh Matrices and q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)

Isomorphisms of graphs of Hyperbinary Expansions and Efficient Algorithms for Stern's Diatomic Sequence
by: De Paris, Alessandro
Published: (2024)

Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut
by: Jahannia, Marieh, et al.
Published: (2024)

No weakly factor-universal cellular automaton
by: Gwozdz, Maja
Published: (2026)

Density and Symmetry in the Generalized Motzkin Numbers mod $p$
by: Kohen, Nadav
Published: (2024)

Box Progressions, Abelian Power-Free Morphisms and A Sieve Technique for the Template Method
by: Eyidoğan, Sadık, et al.
Published: (2026)

On the minimal memory set of cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies
by: Gerlach, Raphael, et al.
Published: (2023)

Dumont-Thomas complement numeration systems for $\mathbb{Z}$
by: Labbé, Sébastien, et al.
Published: (2023)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains-Algorithmic Perspective
by: Al-atar, Munqath, et al.
Published: (2024)

Approximate Integrity Constraints in Incomplete Databases With Limited Domains
by: Al-atar, Munqath, et al.
Published: (2024)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)

Thermodynamic Formalism for a family of cellular automata and duality with the shift
by: Lopes, Artur O., et al.
Published: (2024)