Coverability for order-k nested reset counter systems is F_Ωk-complete.
Lambek calculus is NP-complete
1 Pith paper cite this work, alongside 62 external citations. Polarity classification is still indexing.
1
Pith paper citing it
62
external citations · Crossref
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Complexity of Nested Reset Counter Systems
Coverability for order-k nested reset counter systems is F_Ωk-complete.