Determinisation of min-plus weighted automata lies in the fast-growing hierarchy.
That is, setVj = supp(nearb(ρj,x )) for b = GCov(d + 1,i ) where I ={ρ1 <...<ρi}
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.