Parikh Automata on Finite and Infinite Words
Formal Languages and Automata Theory
2025-11-12 v3 Logic in Computer Science
Abstract
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.
Keywords
Cite
@article{arxiv.2307.07238,
title = {Parikh Automata on Finite and Infinite Words},
author = {Mario Grobler and Leif Sabellek and Sebastian Siebertz},
journal= {arXiv preprint arXiv:2307.07238},
year = {2025}
}