Image de couverture de livre

The complexity of separability for semilinear sets and Parikh automata

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Collins, Elias Rojas, Köcher, Chris, Zetzsche, Georg
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
par: Bergsträßer, Pascal, et autres
Publié: (2024)

Deterministic Parikh automata on infinite words
par: Grobler, Mario, et autres
Publié: (2024)

Infinite-state Games with Energy Objectives Beyond Counters
par: Sağlam, Irmak, et autres
Publié: (2026)

History-deterministic Parikh Automata
par: Erlich, Enzo, et autres
Publié: (2022)

The Counting Power of Transformers
par: Sälzer, Marco, et autres
Publié: (2025)

Reachability in Trace-Pushdown Systems
par: Köcher, Chris, et autres
Publié: (2025)

Non-Global Parikh Tree Automata
par: Herrmann, Luisa, et autres
Publié: (2024)

Star Complexity of Parikh Images of Languages over Infinite Alphabets
par: Danieli, Yoav
Publié: (2026)

Directed Regular and Context-Free Languages
par: Ganardi, Moses, et autres
Publié: (2024)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
par: Zetzsche, Stefan, et autres
Publié: (2024)

Bounded treewidth, multiple context-free grammars, and downward closures
par: Aiswarya, C., et autres
Publié: (2025)

The complexity of reachability problems in strongly connected finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Exact descriptional complexity of determinization of input-driven pushdown automata
par: Martynova, Olga
Publié: (2024)

Weakly-unambiguous Parikh automata and their link to holonomic series
par: Bostan, Alin, et autres
Publié: (2025)

Database-assisted automata learning
par: Walinga, Hielke, et autres
Publié: (2024)

Conway's cosmological theorem and automata theory
par: Lairez, Pierre, et autres
Publié: (2024)

Cerny type automata and rank conjecture
par: Rystsov, Igor
Publié: (2025)

Slice closures of indexed languages and word equations with counting constraints
par: Ciobanu, Laura, et autres
Publié: (2024)

Entropy of pebble automata and space complexity
par: Montoya, J. Andres
Publié: (2026)

Non-deterministic asynchronous automata games and their undecidability
par: Adsul, Bharat, et autres
Publié: (2024)

Diagnosability of labeled $\mathfrak{D_p}$ automata
par: Zhang, Kuize, et autres
Publié: (2021)

Attractors of Parikh mapping iterations
par: Chunikhin, Alexander
Publié: (2024)

Parikh's Theorem Made Symbolic
par: Hague, Matthew, et autres
Publié: (2023)

Characterizing normality via automata and random matrix products
par: Bienvenu, Laurent, et autres
Publié: (2026)

Nondeterminism makes unary 1-limited automata concise
par: Guillon, Bruno, et autres
Publié: (2025)

Two-way affine automata can verify every language
par: Chen, Zeyu, et autres
Publié: (2025)

Soft state reduction of fuzzy automata over residuated lattices
par: Nguyen, Linh Anh, et autres
Publié: (2025)

Deterministic pushdown automata can compress some normal sequences
par: Carton, Olivier, et autres
Publié: (2022)

Parikh Automata on Finite and Infinite Words
par: Grobler, Mario, et autres
Publié: (2023)

Cluster automata
par: Kornai, András
Publié: (2025)

State estimation of timed automata under partial observation [Draft version]
par: Gao, Chao, et autres
Publié: (2024)

Execution-time opacity problems in one-clock parametric timed automata
par: André, Étienne, et autres
Publié: (2024)

The complexity of downward closures of indexed languages
par: Mandel, Richard, et autres
Publié: (2026)

Quantum finite automata and linear context-free languages: a decidable problem
par: Bertoni, A., et autres
Publié: (2013)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
par: Baumann, Pascal, et autres
Publié: (2024)

Verifying Unboundedness via Amalgamation
par: Anand, Ashwani, et autres
Publié: (2024)

Existential Definability over the Subword Ordering
par: Baumann, Pascal, et autres
Publié: (2022)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
par: Briones, Laura Brandán, et autres
Publié: (2025)

Saturating automata for game semantics
par: Dixon, Alex, et autres
Publié: (2023)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
par: Zhang, Kuize, et autres
Publié: (2024)