Coverability for order-k nested reset counter systems is F_Ωk-complete.
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma , booktitle =
2 Pith papers cite this work, alongside 58 external citations. Polarity classification is still indexing.
2
Pith papers citing it
58
external citations · Crossref
citation-role summary
background 1
citation-polarity summary
fields
cs.FL 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Star-height of Parikh images is bounded by 2 for one-register automata but the rational conjecture fails for multiple registers, showing Parikh's theorem does not hold over infinite alphabets.
citing papers explorer
-
The Complexity of Nested Reset Counter Systems
Coverability for order-k nested reset counter systems is F_Ωk-complete.
-
Star Complexity of Parikh Images of Languages over Infinite Alphabets
Star-height of Parikh images is bounded by 2 for one-register automata but the rational conjecture fails for multiple registers, showing Parikh's theorem does not hold over infinite alphabets.