Open Access
- 12 July 2025
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 26 (3) , 1-36
Abstract
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.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Token Games and History-Deterministic Quantitative Automata2022
- Two-Way Parikh Automata with a Visibly Pushdown Stack2019
- On a class of languages with holonomic generating functionsTheoretical Computer Science, 2017
- On Determinisation of Good-for-Games Automata2015
- Nondeterminism in the Presence of a Diverse or Unknown FutureLecture Notes in Computer Science, 2013
- The Theory of Stabilisation Monoids and Regular Cost Functions2009
- Solving Games Without Determinization2006
- Monadic Second-Order Logics with Cardinalities2003
- Automata Logics, and Infinite Games2002
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974