Parikh Automata on Finite and Infinite Words
Mario Grobler, Leif Sabellek, Sebastian Siebertz
我们研究Parikh自动机在有限和无限的单词。 首先,我们在有限词上为Parikh自动机建立了一些结果。 接下来,我们介绍了Parikh自动机在无限单词上的几个定义。 我们考虑了确定性和非确定性变体,并研究闭包属性,表现力和常见决策问题,用于模型检查的应用程序。 此外,我们将我们的模型与其他模型进行比较,计算机制在无限单词上运行。
We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh automata on infinite words. We consider the deterministic as well as the non-deterministic variants and study closure properties, expressiveness, and common decision problems with applications to model checking. Furthermore, we compare our models to other models with counting mechanisms operating on infinite words.