Enzo Erlich
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Enzo Erlich has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Ismaël Jecker
Université Marie et Louis Pasteur, CNRS, Institut FEMTO-ST, Besançon, France
1 shared publication - Karoliina Lehtinen
LIS CNRS Aix-Marseille University
1 shared publication - Mario Grobler
University of Bremen, Bremen, Germany
1 shared publication - Martin Zimmermann
Aalborg University, Aalborg, Denmark
1 shared publication - Shibashis Guha
Tata Institute of Fundamental Research
1 shared publication
Latest Publications
- Open Access
- 12 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 26 (3) , 1-36
History-Deterministic Parikh Automata
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.
- 12 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 26 (3) , 1-36
Open AccessHistory-Deterministic Parikh Automata
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.