2024/01/26 by Mario Grobler, Grobler, Mario, Sebastian Siebertz +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Chemical Synthesis and Analysis #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2401.14737
openalex publication_date 2024/01/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Various variants of Parikh automata on infinite words have recently been introduced in the literature. However, with some exceptions only their non-deterministic versions have been considered. In this paper we study the deterministic versions of all variants of Parikh automata on infinite words that have not yet been studied. We compare the expressiveness of the deterministic models and investigate 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.