2026-07-22T23:58:01Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:19025 2024-03-06T11:03:18Z ddc:004 open_access

History-Deterministic Parikh Automata Erlich, Enzo Guha, Shibashis Jecker, Ismaël Lehtinen, Karoliina Zimmermann, Martin Parikh automata History-determinism Reversal-bounded Counter Machines 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Enzo Erlich and Shibashis Guha and Ismaël Jecker and Karoliina Lehtinen and Martin Zimmermann 2023 Is Part Of LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2023.31 urn:nbn:de:0030-drops-190250 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.31 eng https://creativecommons.org/licenses/by/4.0/legalcode