Cover Image

The Complexity of Nested Reset Counter Systems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Balasubramanian, A. R., Schmidt, Franzisco
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory Computational Complexity Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
by: Shakiba, Yousef, et al.
Published: (2025)

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
by: Göller, Stefan, et al.
Published: (2023)

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

Non-commutative linear logic fragments with sub-context-free complexity
by: Nishimiya, Yusaku, et al.
Published: (2025)

Nets-within-Nets through the Lens of Data Nets
by: Di Cosmo, Francesco, et al.
Published: (2025)

On Higher Order Busy Beaver Function
by: Cao, Zining
Published: (2025)

Stochastic Process Turing Machines
by: Wolpert, David, et al.
Published: (2024)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
by: Achilleos, Antonis, et al.
Published: (2024)

Reachability in Geometrically $d$-Dimensional VASS
by: Fu, Yuxi, et al.
Published: (2025)

Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)

Extending QuAK with Nested Quantitative Automata
by: Henzinger, Thomas A., et al.
Published: (2026)

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

A Framework for Universality in Physics, Computer Science, and Beyond
by: Gonda, Tomáš, et al.
Published: (2023)

CMSO-transducing tree-like graph decompositions
by: Campbell, Rutger, et al.
Published: (2024)

Weighted basic parallel processes and combinatorial enumeration
by: Clemente, Lorenzo
Published: (2024)

A positional $\mathbfΠ^0_3$-complete objective
by: Casares, Antonio, et al.
Published: (2024)

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
by: Bhaduri, Purandar
Published: (2025)

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

The Complexity of Second-order HyperLTL
by: Frenkel, Hadar, et al.
Published: (2023)

The Complexity of Generalized HyperLTL with Stuttering and Contexts
by: Regaud, Gaëtan, et al.
Published: (2025)

On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
by: Ancona, Davide, et al.
Published: (2025)

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
by: Finkbeiner, Bernd, et al.
Published: (2026)

A Session Type System for Asynchronous Unreliable Broadcast Communication
by: Kouzapas, Dimitrios, et al.
Published: (2019)

The Existential Theory of the Reals as a Complexity Class: A Compendium
by: Schaefer, Marcus, et al.
Published: (2024)

Unreliability in Practical Subclasses of Communicating Systems
by: Suresh, Amrita, et al.
Published: (2025)

Improving Reachability in Vector Addition Systems through Pumpability
by: Chen, Weijun, et al.
Published: (2026)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
by: Chistikov, Dmitry, et al.
Published: (2024)

Reachability in Vector Addition System with States Parameterized by Geometric Dimension
by: Zheng, Yangluo
Published: (2024)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
by: Czerwiński, Wojciech, et al.
Published: (2022)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
by: Besset, Antoine, et al.
Published: (2025)

Complexity of Fungal Automaton Prediction
by: Formenti, Enrico, et al.
Published: (2026)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)