Unambiguisability for min-plus weighted automata is decidable via reduction to determinisability, while counter minimization for tropical cost register automata is undecidable for seven or more registers.
Quantitative languages
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Unambiguisability and Register Minimisation of Min-Plus Models
Unambiguisability for min-plus weighted automata is decidable via reduction to determinisability, while counter minimization for tropical cost register automata is undecidable for seven or more registers.