History-deterministic Parikh Automata
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912396214272000 |
|---|---|
| author | Erlich, Enzo Grobler, Mario Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina Zimmermann, Martin |
| author_facet | Erlich, Enzo Grobler, Mario Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina Zimmermann, Martin |
| contents | Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run. Thereby, they preserve many of the desirable properties of finite automata. Deterministic Parikh automata are strictly weaker than nondeterministic ones, but enjoy better closure and algorithmic properties.
This state of affairs motivates the study of intermediate forms of nondeterminism. Here, we investigate history-deterministic Parikh automata, i.e., automata whose nondeterminism can be resolved on the fly. This restricted form of nondeterminism is well-suited for applications which classically call for determinism, e.g., solving games and composition.
We show that history-deterministic Parikh automata are strictly more expressive than deterministic ones, incomparable to unambiguous ones, and enjoy almost all of the closure properties of deterministic automata. Finally, we investigate the complexity of resolving nondeterminism in history-deterministic Parikh automata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_07745 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | History-deterministic Parikh Automata Erlich, Enzo Grobler, Mario Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina Zimmermann, Martin Formal Languages and Automata Theory Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run. Thereby, they preserve many of the desirable properties of finite automata. Deterministic Parikh automata are strictly weaker than nondeterministic ones, but enjoy better closure and algorithmic properties. This state of affairs motivates the study of intermediate forms of nondeterminism. Here, we investigate history-deterministic Parikh automata, i.e., automata whose nondeterminism can be resolved on the fly. This restricted form of nondeterminism is well-suited for applications which classically call for determinism, e.g., solving games and composition. We show that history-deterministic Parikh automata are strictly more expressive than deterministic ones, incomparable to unambiguous ones, and enjoy almost all of the closure properties of deterministic automata. Finally, we investigate the complexity of resolving nondeterminism in history-deterministic Parikh automata. |
| title | History-deterministic Parikh Automata |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2209.07745 |