{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:42:28Z","timestamp":1754145748560,"version":"3.41.2"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2025,7,31]]},"abstract":"<jats:p>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.<\/jats:p>\n          <jats:p>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.<\/jats:p>\n          <jats:p>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.<\/jats:p>","DOI":"10.1145\/3742431","type":"journal-article","created":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T11:48:26Z","timestamp":1748864906000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["History-Deterministic Parikh Automata"],"prefix":"10.1145","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3574-6362","authenticated-orcid":false,"given":"Enzo","family":"Erlich","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris Cit\u00e9, CNRS, IRIF, Paris, France and EPITA Research Laboratory (LRE), Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8103-6440","authenticated-orcid":false,"given":"Mario","family":"Grobler","sequence":"additional","affiliation":[{"name":"University of Bremen, Bremen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-6651","authenticated-orcid":false,"given":"Shibashis","family":"Guha","sequence":"additional","affiliation":[{"name":"Tata Institute of Fundamental Research, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6527-4470","authenticated-orcid":false,"given":"Isma\u00ebl","family":"Jecker","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Marie et Louis Pasteur, CNRS, Institut FEMTO-ST, Besan\u00e7on, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1171-8790","authenticated-orcid":false,"given":"Karoliina","family":"Lehtinen","sequence":"additional","affiliation":[{"name":"CNRS, LIS, Aix-Marseille University, Marseille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8038-2453","authenticated-orcid":false,"given":"Martin","family":"Zimmermann","sequence":"additional","affiliation":[{"name":"Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,12]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2018.16"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80027-9"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_11"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2021.38"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99253-8_7"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3584676.3584682"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2020.114"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1051\/ITA\/2012013"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054113400339"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.022"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.10842707"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2017.117"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_12"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17127-8_11"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196700000315"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44693-1_13"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CONCUR.2023.31"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.39"},{"key":"e_1_3_2_20_2","first-page":"40:1","volume-title":"FSTTCS 2019","author":"Filiot Emmanuel","year":"2019","unstructured":"Emmanuel Filiot, Shibashis Guha, and Nicolas Mazzocchi. 2019. Two-way Parikh automata. In FSTTCS 2019. Arkadev Chattopadhyay and Paul Gastin (Eds.), LIPIcs, Vol. 150, Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, 40:1\u201340:14."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054120410038"},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Seymour Ginsburg and Edwin H. Spanier. 1964. Bounded ALGOL-like languages. Transactions of the American Mathematical Society 113 2 (1964) 333\u2013368.","DOI":"10.1090\/S0002-9947-1964-0181500-1"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.285"},{"key":"e_1_3_2_24_2","first-page":"31:1","volume-title":"CSL 2024","author":"Grobler Mario","year":"2024","unstructured":"Mario Grobler, Leif Sabellek, and Sebastian Siebertz. 2024. Remarks on Parikh-recognizable omega-languages. In CSL 2024. Aniello Murano and Alexandra Silva (Eds.), LIPIcs, Vol. 288, Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 31:1\u201331:21."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.FSTTCS.2022.40"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.46298\/LMCS-20(1:3)2024"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CONCUR.2022.14"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_26"},{"key":"e_1_3_2_30_2","volume-title":"Languages and Computation","author":"Hopcroft John E.","year":"1979","unstructured":"John E. Hopcroft and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322058"},{"key":"e_1_3_2_32_2","unstructured":"Felix Klaedtke and Harald Rue\u00df. 2002. Parikh Automata and Monadic Second-Order Logics with Linear Cardinality Constraints. Technical Report 177. Albert-Ludwigs-Universit\u00e4t Freiburg. Retrieved from ftp:\/\/ftp.informatik.uni-freiburg.de\/documents\/reports\/report177\/report00177.ps.gz"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_54"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_24"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.46298\/lmcs-18(1:3)2022"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054105003418"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2013.327"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.5555\/1095587"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00200-6"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"e_1_3_2_41_2","unstructured":"Karianto Wong. 2004. Parikh Automata with Pushdown Stack. Diploma thesis. RWTH Aachen University. Retrieved from https:\/\/old.automata.rwth-aachen.de\/download\/papers\/karianto\/ka04.pdf"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3742431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T12:35:39Z","timestamp":1752755739000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3742431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,12]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7,31]]}},"alternative-id":["10.1145\/3742431"],"URL":"https:\/\/doi.org\/10.1145\/3742431","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2025,7,12]]},"assertion":[{"value":"2024-10-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}