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.

翻译：我们证明了最小加（热带）加权自动机的确定化问题是可判定的，从而解决了这个长期存在的开放性问题。在此过程中，我们开发了一套新的工具箱，用于分析和推理非确定性自动机的运行结构。