13 The Cactus Extension Intuitively, when reaching a stable cycle, we wish to mimic its long-term behaviour with a single letter

If (s,r )∈GrnPairs(S′,w ) with grounding stateg, then mwt(s wm·2m −−−−→r) = mwt(s wM0·2m −−−−−→r) = mwt(s wm −−→g wm −−→r) Moreover, we havemwt(s wm′·2m −−−−−→r)≤mwt(s wm −−→g wm −−→r) for everym′∈N · 2026

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

A Complexity Bound for Determinisation of Min-Plus Weighted Automata

cs.FL · 2026-02-01 · unverdicted · novelty 8.0

Determinisation of min-plus weighted automata lies in the fast-growing hierarchy.

citing papers explorer

Showing 1 of 1 citing paper.

A Complexity Bound for Determinisation of Min-Plus Weighted Automata cs.FL · 2026-02-01 · unverdicted · none · ref 4
Determinisation of min-plus weighted automata lies in the fast-growing hierarchy.

13 The Cactus Extension Intuitively, when reaching a stable cycle, we wish to mimic its long-term behaviour with a single letter

fields

years

verdicts

representative citing papers

citing papers explorer