Determinization of Min-Plus Weighted Automata is Decidable
Formal Languages and Automata Theory
2025-04-01 v1 Logic in Computer Science
Abstract
We show that the determinization problem for min-plus (tropical) weighted automata is decidable, thus resolving this long-standing open problem. In doing so, we develop a new toolbox for analyzing and reasoning about the run-structure of nondeterministic automata.
Keywords
Cite
@article{arxiv.2503.23826,
title = {Determinization of Min-Plus Weighted Automata is Decidable},
author = {Shaull Almagor and Guy Arbel and Sarai Sheinvald},
journal= {arXiv preprint arXiv:2503.23826},
year = {2025}
}