Deterministic Parikh automata on infinite words
CoRR(2024)
摘要
Various variants of Parikh automata on infinite words have recently been
introduced and studied in the literature. However, with some exceptions only
their non-deterministic versions have been studied. In this paper we study the
deterministic versions of all variants of Parikh automata on infinite words
that have not yet been studied in the literature. We compare the expressiveness
of the deterministic models, study their closure properties and decision
problems with applications to model checking. The model of deterministic limit
Parikh automata turns out to be most interesting, as it is the only
deterministic Parikh model generalizing the ω-regular languages, the
only deterministic Parikh model closed under the Boolean operations and the
only deterministic Parikh model for which all common decision problems are
decidable.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要