Cover Image

Conway's cosmological theorem and automata theory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lairez, Pierre, Storozhenko, Aleksandr
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Agafonov and Schnorr-Stimm theorems for probabilistic automata
by: Bienvenu, Laurent, et al.
Published: (2025)

Database-assisted automata learning
by: Walinga, Hielke, et al.
Published: (2024)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

Cerny type automata and rank conjecture
by: Rystsov, Igor
Published: (2025)

The complexity of separability for semilinear sets and Parikh automata
by: Collins, Elias Rojas, et al.
Published: (2024)

Non-deterministic asynchronous automata games and their undecidability
by: Adsul, Bharat, et al.
Published: (2024)

Diagnosability of labeled $\mathfrak{D_p}$ automata
by: Zhang, Kuize, et al.
Published: (2021)

The complexity of reachability problems in strongly connected finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

Characterizing normality via automata and random matrix products
by: Bienvenu, Laurent, et al.
Published: (2026)

Nondeterminism makes unary 1-limited automata concise
by: Guillon, Bruno, et al.
Published: (2025)

Exact descriptional complexity of determinization of input-driven pushdown automata
by: Martynova, Olga
Published: (2024)

Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)

Soft state reduction of fuzzy automata over residuated lattices
by: Nguyen, Linh Anh, et al.
Published: (2025)

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Cluster automata
by: Kornai, András
Published: (2025)

State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)

Execution-time opacity problems in one-clock parametric timed automata
by: André, Étienne, et al.
Published: (2024)

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
by: Briones, Laura Brandán, et al.
Published: (2025)

Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
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)

Completeness for categories of generalized automata
by: Boccali, Guido, et al.
Published: (2023)

A study on the composition of elementary cellular automata
by: Castillo-Ramirez, Alonso, et al.
Published: (2023)

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
by: Dennunzio, Alberto, et al.
Published: (2026)

Modeling and Simulating Agent-Based City Migration Using Conway's Game of Life
by: Deng, Bruce, et al.
Published: (2024)

Idempotent cellular automata and their natural order
by: Castillo-Ramirez, Alonso, et al.
Published: (2024)

Eilenberg theorems for many-sorted formations
by: Vidal, Juan Climent, et al.
Published: (2016)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

Equality of cycle lengths in one- and two-dimensional $σ$ automata
by: Vadali, Avi, et al.
Published: (2025)

Entropy of pebble automata and space complexity
by: Montoya, J. Andres
Published: (2026)

Congruence based proofs of the recognizability theorems for free many-sorted algebras
by: Vidal, Juan Climent, et al.
Published: (2018)

The theory of reachability in trace-pushdown systems
by: Kuske, Dietrich
Published: (2025)

Cellular automata can really solve the parity problem
by: Wolnik, Barbara, et al.
Published: (2025)

Twinning automata and regular expressions for string static analysis
by: Negrini, Luca, et al.
Published: (2020)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
by: Goles, Eric, et al.
Published: (2026)

Bisimilarity in fresh-register automata
by: Murawski, Andrzej S., et al.
Published: (2020)

Symbolic ω-automata with obligations
by: Di Stefano, Luca
Published: (2025)

Minimizing Streaming String Transducers: An algebraic approach
by: Benalioua, Yahia Idriss, et al.
Published: (2026)