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.
Decision problems for additive regular functions
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
-
Representing One Letter Weighted Automata Over the Tropical Semiring
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.