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.
What's decidable about weighted automata? Information and Computation , 282:104651
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
roles
method 1polarities
extend 1representative citing papers
Unary weighted automata over the tropical semiring admit a polynomial-time computable quadratic-size union representation of deterministic automata, implying coNP-completeness of determinisation and register minimisation.
New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
Weighted NetKAT extends NetKAT with semiring weights and weighted NetKAT automata to enable automatic verification of quantitative safety and reachability properties.
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.