{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:59:00Z","timestamp":1762300740580,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":76,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101077902"],"award-info":[{"award-number":["101077902"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3661814.3662134","type":"proceedings-article","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T12:30:12Z","timestamp":1718973012000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Slice closures of indexed languages and word equations with counting constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9451-1471","authenticated-orcid":false,"given":"Laura","family":"Ciobanu","sequence":"first","affiliation":[{"name":"Heriot-Watt University, Edinburgh, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6421-4388","authenticated-orcid":false,"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561359"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31982-5_31"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321488"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3484198"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-222145"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2023.110"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571266"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005101"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1_2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00236-002-0085-4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IC.2017.11.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.FSTTCS.2018.48"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313909.3313911"},{"key":"e_1_3_2_1_14_1","unstructured":"Miko\u0142aj Boja\u0144czyk and Wojciech Czerwi\u0144ski. 2018. An automata toolbox. (2018). https:\/\/www.mimuw.edu.pl\/~bojan\/paper\/automata-toolbox-book."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63141-0_10"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8928-6_37"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32304-2_7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498702"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_11"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934527"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90009-3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","unstructured":"Werner Damm and Andreas Goerdt. 1986. An automata-theoretical characterization of the OI-hierarchy. Inf. Control. 71 1\/2 1--32. 10.1016\/S0019-9958(86)80016-X","DOI":"10.1016\/S0019-9958(86)80016-X"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00250-3_2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.04.002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90076-1"},{"volume-title":"Automata, Languages, and Machines (Vol. A)","author":"Eilenberg Samuel","key":"e_1_3_2_1_26_1","unstructured":"Samuel Eilenberg. 1974. Automata, Languages, and Machines (Vol. A). Academic Press, New York."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(69)90070-2"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90015-T"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67089-8_6"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00102-X"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1968-0227290-4"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2022.124"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39611-3_21"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.285"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10854-8_46"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837627"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.34"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90356-7"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.2977\/prims\/1195192738"},{"volume-title":"Department of Computer Science","author":"Hirshfeld Yoram","key":"e_1_3_2_1_40_1","unstructured":"Yoram Hirshfeld. 1994. Congruences in commutative semigroups. LFCS, Department of Computer Science, University of Edinburgh Edinburgh."},{"key":"e_1_3_2_1_41_1","volume-title":"Ullman","author":"Hopcroft John E.","year":"1979","unstructured":"John E. Hopcroft and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Massachusetts."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3614319"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57785-8_173"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268497"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2018.09.035"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487241.2487246"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480933"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.29"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1006\/JSCO.1999.0285"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1006\/JSCO.1999.1015"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1006\/INCO.1999.2812"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"J\u00e9r\u00f4me Leroux. 2022. Compiling Petri net mutual reachability in Presburger. CoRR abs\/2210.09931. arXiv: 2210.09931. 10.48550\/ARXIV.2210.09931","DOI":"10.48550\/ARXIV.2210.09931"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23217-6_22"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.46298\/LMCS-17(4:4)2021"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054121420077"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.46298\/LMCS-18(4:2)2022"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2018.01.002"},{"key":"e_1_3_2_1_59_1","first-page":"38","article-title":"Multilevel stack automata","volume":"12","author":"Maslov A. N.","year":"1976","unstructured":"A. N. Maslov. 1976. Multilevel stack automata. Problems of Information Transmission, 12, 38--43. https:\/\/www.mathnet.ru\/eng\/ppi1676.","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_60_1","first-page":"1170","article-title":"The hierarchy of indexed languages of an arbitrary level","volume":"15","author":"Maslov A. N.","year":"1974","unstructured":"A. N. Maslov. 1974. The hierarchy of indexed languages of an arbitrary level. Soviet Math. Dokl., 15, 1170--1174. https:\/\/www.mathnet.ru\/eng\/dan38470.","journal-title":"Soviet Math. Dokl."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","unstructured":"Ernst W Mayr and Albert R Meyer. 1982. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in mathematics 46 3 305--329. 10.1016\/0001-8708(82)90048-2","DOI":"10.1016\/0001-8708(82)90048-2"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00646-1"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_85"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2004.05.004"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.38"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990312"},{"volume-title":"The theory of finitely generated commutative semigroups","author":"R\u00e9dei \u0139aszl\u00f3","key":"e_1_3_2_1_67_1","unstructured":"\u0139aszl\u00f3 R\u00e9dei. 1965. The theory of finitely generated commutative semigroups. Oxford University Press, NY."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/800161.805156"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22012-8_12"},{"key":"e_1_3_2_1_70_1","unstructured":"Sylvain Schmitz. 2017. Algorithmic Complexity of Well-Quasi-Orders. (Complexit\u00e9 algorithmique des beaux pr\u00e9-ordres). https:\/\/tel.archives-ouvertes.fr\/tel-01663266."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.62"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44522-8_43"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71389-0_25"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53132-7_32"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_35"},{"key":"e_1_3_2_1_76_1","unstructured":"Georg Zetzsche. 2015. An approach to computing downward closures. CoRR abs\/1503.01068. arXiv: 1503.01068."}],"event":{"name":"LICS '24: 39th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE Computer Society","EACSL"],"location":"Tallinn Estonia","acronym":"LICS '24"},"container-title":["Proceedings of the 39th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661814.3662134","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3661814.3662134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:21Z","timestamp":1750291581000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661814.3662134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":76,"alternative-id":["10.1145\/3661814.3662134","10.1145\/3661814"],"URL":"https:\/\/doi.org\/10.1145\/3661814.3662134","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}