Determinisation of min-plus weighted automata lies in the fast-growing hierarchy.
TakeI′={ρ1}(i.e., arbitrarily choose a single independent run from I) sow′ 1w′ 2w′ 3 with I′is a (d−1, 1) fit word, as per Definition 19.7
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Complexity Bound for Determinisation of Min-Plus Weighted Automata
Determinisation of min-plus weighted automata lies in the fast-growing hierarchy.