Cover Image

Automaticity of spacetime diagrams generated by cellular automata on commutative monoids

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Nesme, Vincent
Format:	Preprint
Published:	2022
Subjects:	Discrete Mathematics Formal Languages and Automata Theory Dynamical Systems 11B85, 37B15 F.1.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)

Topological transitivity of group cellular automata is decidable
by: Castronuovo, Niccolò, et al.
Published: (2026)

Construction of Minkowski Sums by Cellular Automata
by: Tahay, Pierre-Adrien
Published: (2024)

Symbols frequencies in the Thue--Morse word in base $3/2$ and related conjectures
by: Cassaigne, Julien, et al.
Published: (2026)

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

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

Limit dynamics of elementary cellular automaton 18
by: Sabrié, Hervé, et al.
Published: (2023)

Extended branching Rauzy induction
by: Dolce, Francesco, et al.
Published: (2025)

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

Combinatorics on words and generating Dirichlet series of automatic sequences
by: Allouche, Jean-Paul, et al.
Published: (2024)

Reduced complexities for sequences over finite alphabets
by: Campbell, John M., et al.
Published: (2025)

One-dimensional cellular automata with a unique active transition
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
by: Mathew, Prince, et al.
Published: (2024)

Monochromatic arithmetic progressions in the Fibonacci, Thue-Morse, and Rudin-Shapiro words
by: Joshi, Gandhar, et al.
Published: (2025)

Minimality and computability of languages of G-shifts
by: Amir, Djamel Eddine, et al.
Published: (2025)

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

A Myhill-Nerode Type Characterization of 2detLIN Languages
by: Nagy, Benedek
Published: (2025)

Exploring VASS Parameterised by Geometric Dimension
by: Czerwiński, Wojciech, et al.
Published: (2026)

Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2024)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
by: Baumann, Pascal, et al.
Published: (2024)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
by: Scoones, Andrew, et al.
Published: (2024)

Flattability of Priority Vector Addition Systems
by: Guttenberg, Roland
Published: (2024)

On Constructing Finite Automata by Relational Programming
by: Egri-Nagy, Attila, et al.
Published: (2025)

Checking Timed Bisimilarity with Virtual Clocks
by: Lieb, Alexander, et al.
Published: (2024)

The speed of convergence in greedy Galois games
by: Shallit, Jeffrey
Published: (2026)

Maximizing entropy for power-free languages
by: Climenhaga, Vaughn
Published: (2025)

Multiband linear cellular automata and endomorphisms of algebraic vector groups
by: Byszewski, Jakub, et al.
Published: (2022)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
by: Hendel, Russell Jay
Published: (2025)

Structure and computability of preimages in the Game of Life
by: Salo, Ville, et al.
Published: (2023)

Finding codes on infinite grids automatically
by: Salo, Ville, et al.
Published: (2023)

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

On Direct Product and Quotient of Strongly Connected Automata
by: Hu, Zino H.
Published: (2011)

Mahler equations for Zeckendorf numeration
by: Carton, Olivier, et al.
Published: (2024)

On Countable SFT Covers of Sparse Multidimensional Shift Spaces
by: Törmä, Ilkka
Published: (2024)

A Uniform Framework for Problems on Context-Free Grammars
by: Esparza, Javier, et al.
Published: (2024)

On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
by: Löding, Christof, et al.
Published: (2024)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
by: Löding, Christof, et al.
Published: (2022)

Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)

Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)