It is a well known fact that not all max-plus automata can be determinized, i.e. transformed into deterministic max-plus automata with the same behavior. A classical sequentialization procedure, extended in the literature to max-plus automata, succeeds in computing an equivalent deterministic max-plus automaton for important subclasses of max-plus automata. This procedure is based on the normalization of state vectors in order to detect and merge states which have similar future behavior. In this paper, a novel and weaker condition is proposed that still guarantees this property. This allows for a considerable improvement of the existing determinization procedure, because it terminates for a larger class of max-plus automata.

中文翻译：

---

对最大加自动机的确定性的贡献

众所周知，并非所有的最大加自动机都可以被确定，即转换为具有相同行为的确定性最大加自动机。在文献中扩展到最大加自动机的经典序列化过程成功地为最大加自动机的重要子类计算了等效的确定性最大加自动机。该过程基于状态向量的归一化，以检测和合并具有相似未来行为的状态。在本文中，提出了一种新的、较弱的条件，但仍能保证这种性质。这允许对现有的确定过程进行相当大的改进，因为它终止于更大类别的最大加自动机。