Determinisation of min-plus weighted automata lies in the fast-growing hierarchy.
Then B can be partitioned to B =V1∪...∪Vℓfor someℓsuch that the following hold
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.