Image de couverture de livre

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Shakiba, Yousef, Sinclair-Banks, Henry, Zetzsche, Georg
Format:	Preprint
Publié:	2025
Sujets:	Formal Languages and Automata Theory Computational Complexity Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Invariants for One-Counter Automata with Disequality Tests
par: Chistikov, Dmitry, et autres
Publié: (2024)

The Complexity of Nested Reset Counter Systems
par: Balasubramanian, A. R., et autres
Publié: (2026)

General Decidability Results for Systems with Continuous Counters
par: Balasubramanian, A. R., et autres
Publié: (2025)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
par: Achilleos, Antonis, et autres
Publié: (2024)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
par: Göller, Stefan, et autres
Publié: (2023)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
par: Halftermeyer, Pierre
Publié: (2026)

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

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

Non-commutative linear logic fragments with sub-context-free complexity
par: Nishimiya, Yusaku, et autres
Publié: (2025)

An efficient quantifier elimination procedure for Presburger arithmetic
par: Haase, Christoph, et autres
Publié: (2024)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
par: Chistikov, Dmitry, et autres
Publié: (2024)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
par: Yamakami, Tomoyuki
Publié: (2024)

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
par: Lichtner, Kilian, et autres
Publié: (2025)

Random Deterministic Automata With One Added Transition
par: Carayol, Arnaud, et autres
Publié: (2024)

Nets-within-Nets through the Lens of Data Nets
par: Di Cosmo, Francesco, et autres
Publié: (2025)

On Higher Order Busy Beaver Function
par: Cao, Zining
Publié: (2025)

Reachability in Geometrically $d$-Dimensional VASS
par: Fu, Yuxi, et autres
Publié: (2025)

Stochastic Process Turing Machines
par: Wolpert, David, et autres
Publié: (2024)

A Dichotomy Theorem for Automatic Structures
par: Cuvelier, Antoine, et autres
Publié: (2026)

A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
par: Doveri, Kyveli, et autres
Publié: (2026)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
par: Guha, Shibashis, et autres
Publié: (2026)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
par: Havlena, Vojtěch, et autres
Publié: (2022)

Rerailing Automata
par: Ehlers, Rüdiger
Publié: (2025)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
par: Yamakami, Tomoyuki
Publié: (2021)

Automata on $S$-adic words
par: Berthé, Valérie, et autres
Publié: (2025)

Intersecting Dense Automata
par: Chistikov, Dmitry, et autres
Publié: (2026)

On Good-for-MDPs Automata
par: Schewe, Sven, et autres
Publié: (2022)

Inferring Symbolic Automata
par: Fisman, Dana, et autres
Publié: (2021)

Complexity of Unary Exclusive Nondeterministic Finite Automata
par: Kutrib, Martin, et autres
Publié: (2024)

Variants of Higher-Dimensional Automata
par: Bazille, Hugo, et autres
Publié: (2026)

Quantitative Semantics for Jumping Automata
par: Almagor, Shaull, et autres
Publié: (2024)

History-deterministic Timed Automata
par: Bose, Sougata, et autres
Publié: (2023)

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

Knowledge Compilation for Quantification in Alternating Automata
par: Akshay, S., et autres
Publié: (2026)

Logic and Languages of Higher-Dimensional Automata
par: Amrane, Amazigh, et autres
Publié: (2024)

Arbitrary-arity Tree Automata and QCTL
par: Laroussinie, François, et autres
Publié: (2024)

Bisimulations and Logics for Higher-Dimensional Automata
par: Zouari, Safa, et autres
Publié: (2024)

Counting and Sampling Traces in Regular Languages
par: de Colnet, Alexis, et autres
Publié: (2025)

Softmax Transformers are Turing-Complete
par: Jiang, Hongjian, et autres
Publié: (2025)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
par: Guha, Shibashis, et autres
Publié: (2021)