论文标题
历史确定性的帕里克自动机
History-deterministic Parikh Automata
论文作者
论文摘要
Parikh Automata通过计数器扩展有限自动机，可以在半连接组中测试成员资格，但仅在运行结束时进行。因此，它们保留了有限自动机的许多理想特性。确定性的帕里克自动机严格比非确定性弱弱，但享有更好的闭合和算法属性。 这种状况激发了对非确定性中间形式的研究。在这里，我们研究了历史确定的帕里族自动机，即，可以即时解决其非确定性的自动机。这种不确定性的限制形式非常适合通常要求确定论的应用程序，例如解决游戏和组成。 我们表明，确定性的帕里卡自动机比确定性的自动机更具表现力，对明确的帕里卡（parikh Automata）无与伦比，并且享受确定性自动机的几乎所有封闭属性。最后，我们研究了在历史确定的帕里克自动机中解决非确定性的复杂性。
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run. Thereby, they preserve many of the desirable properties of finite automata. Deterministic Parikh automata are strictly weaker than nondeterministic ones, but enjoy better closure and algorithmic properties. This state of affairs motivates the study of intermediate forms of nondeterminism. Here, we investigate history-deterministic Parikh automata, i.e., automata whose nondeterminism can be resolved on the fly. This restricted form of nondeterminism is well-suited for applications which classically call for determinism, e.g., solving games and composition. We show that history-deterministic Parikh automata are strictly more expressive than deterministic ones, incomparable to unambiguous ones, and enjoy almost all of the closure properties of deterministic automata. Finally, we investigate the complexity of resolving nondeterminism in history-deterministic Parikh automata.
