Parikh Automata on Finite and Infinite Words
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914148074389504 |
|---|---|
| author | Grobler, Mario Sabellek, Leif Siebertz, Sebastian |
| author_facet | Grobler, Mario Sabellek, Leif Siebertz, Sebastian |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_07238 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Parikh Automata on Finite and Infinite Words Grobler, Mario Sabellek, Leif Siebertz, Sebastian Formal Languages and Automata Theory Logic in Computer Science 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. |
| title | Parikh Automata on Finite and Infinite Words |
| topic | Formal Languages and Automata Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2307.07238 |