Cellular automata can really solve the parity problem
Fuente:
arXiv
Saved in:
| Main Authors: | Wolnik, Barbara, Nenca, Anna, Balbi, Pedro Paulo, De Baets, Bernard |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Graph and wreath products of cellular automata
by: Salo, Ville
Published: (2020)
by: Salo, Ville
Published: (2020)
Connections between the minimal neighborhood and the activity value of cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2025)
by: Castillo-Ramirez, Alonso, et al.
Published: (2025)
On the order of lazy cellular automata
by: Alcalá-Arroyo, Edgar, et al.
Published: (2025)
by: Alcalá-Arroyo, Edgar, et al.
Published: (2025)
Decidable problems in substitution shifts
by: Béal, Marie-Pierre, et al.
Published: (2021)
by: Béal, Marie-Pierre, et al.
Published: (2021)
A categorical framework for cellular automata
by: Castillo-Ramirez, A., et al.
Published: (2026)
by: Castillo-Ramirez, A., et al.
Published: (2026)
Topological transitivity of group cellular automata is decidable
by: Castronuovo, Niccolò, et al.
Published: (2026)
by: Castronuovo, Niccolò, et al.
Published: (2026)
Word problems and embedding-obstructions in cellular automata groups on groups
by: Salo, Ville
Published: (2025)
by: Salo, Ville
Published: (2025)
On a Constraint on Invariant Measures of Certain Cellular Automata
by: Tal, Matan
Published: (2026)
by: Tal, Matan
Published: (2026)
Rule-based Generation of de Bruijn Sequences: Memory and Learning
by: Muñoz, Francisco J., et al.
Published: (2025)
by: Muñoz, Francisco J., et al.
Published: (2025)
Sequential densities of rational languages
by: Gorman, Alexi Block, et al.
Published: (2026)
by: Gorman, Alexi Block, et al.
Published: (2026)
Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)
by: Chen, Zeyu, et al.
Published: (2025)
Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)
by: Carton, Olivier, et al.
Published: (2022)
The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)
by: Kiefer, Stefan, et al.
Published: (2025)
The complexity of finite smooth words over binary alphabets
by: Cassaigne, Julien, et al.
Published: (2026)
by: Cassaigne, Julien, et al.
Published: (2026)
Execution-time opacity problems in one-clock parametric timed automata
by: André, Étienne, et al.
Published: (2024)
by: André, Étienne, et al.
Published: (2024)
Escape of mass of the Thue-Morse sequence
by: Nesharim, Erez, et al.
Published: (2025)
by: Nesharim, Erez, et al.
Published: (2025)
Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)
by: Bertoni, A., et al.
Published: (2013)
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Database-assisted automata learning
by: Walinga, Hielke, et al.
Published: (2024)
by: Walinga, Hielke, et al.
Published: (2024)
On the minimal memory set of cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)
Cerny type automata and rank conjecture
by: Rystsov, Igor
Published: (2025)
by: Rystsov, Igor
Published: (2025)
Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)
by: Grobler, Mario, et al.
Published: (2024)
Conway's cosmological theorem and automata theory
by: Lairez, Pierre, et al.
Published: (2024)
by: Lairez, Pierre, et al.
Published: (2024)
Universality in computable dynamical systems: Old and new
by: González-Prieto, Ángel, et al.
Published: (2025)
by: González-Prieto, Ángel, et al.
Published: (2025)
The complexity of separability for semilinear sets and Parikh automata
by: Collins, Elias Rojas, et al.
Published: (2024)
by: Collins, Elias Rojas, et al.
Published: (2024)
Non-deterministic asynchronous automata games and their undecidability
by: Adsul, Bharat, et al.
Published: (2024)
by: Adsul, Bharat, et al.
Published: (2024)
Diagnosability of labeled $\mathfrak{D_p}$ automata
by: Zhang, Kuize, et al.
Published: (2021)
by: Zhang, Kuize, et al.
Published: (2021)
Nondeterminism makes unary 1-limited automata concise
by: Guillon, Bruno, et al.
Published: (2025)
by: Guillon, Bruno, et al.
Published: (2025)
Characterizing normality via automata and random matrix products
by: Bienvenu, Laurent, et al.
Published: (2026)
by: Bienvenu, Laurent, et al.
Published: (2026)
One-dimensional cellular automata with a unique active transition
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)
Soft state reduction of fuzzy automata over residuated lattices
by: Nguyen, Linh Anh, et al.
Published: (2025)
by: Nguyen, Linh Anh, et al.
Published: (2025)
Exact descriptional complexity of determinization of input-driven pushdown automata
by: Martynova, Olga
Published: (2024)
by: Martynova, Olga
Published: (2024)
Cluster automata
by: Kornai, András
Published: (2025)
by: Kornai, András
Published: (2025)
State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)
by: Gao, Chao, et al.
Published: (2024)
Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
by: Briones, Laura Brandán, et al.
Published: (2025)
by: Briones, Laura Brandán, et al.
Published: (2025)
Asynchronism in Cellular Automata
by: Gautam, Virendra Kumar
Published: (2025)
by: Gautam, Virendra Kumar
Published: (2025)
Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)
by: Dixon, Alex, et al.
Published: (2023)
Limit dynamics of elementary cellular automaton 18
by: Sabrié, Hervé, et al.
Published: (2023)
by: Sabrié, Hervé, et al.
Published: (2023)
On Countable SFT Covers of Sparse Multidimensional Shift Spaces
by: Törmä, Ilkka
Published: (2024)
by: Törmä, Ilkka
Published: (2024)
Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
by: Ferens, Robert, et al.
Published: (2022)
by: Ferens, Robert, et al.
Published: (2022)
Similar Items
-
Graph and wreath products of cellular automata
by: Salo, Ville
Published: (2020) -
Connections between the minimal neighborhood and the activity value of cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2025) -
On the order of lazy cellular automata
by: Alcalá-Arroyo, Edgar, et al.
Published: (2025) -
Decidable problems in substitution shifts
by: Béal, Marie-Pierre, et al.
Published: (2021) -
A categorical framework for cellular automata
by: Castillo-Ramirez, A., et al.
Published: (2026)