{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:53:29Z","timestamp":1781855609503,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209158","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"512-520","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Wreath Products of Distributive Forest Algebras"],"prefix":"10.1145","author":[{"given":"Michael","family":"Hahn","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Krebs","sequence":"additional","affiliation":[{"name":"University of T\u00fcbingen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Howard","family":"Straubing","sequence":"additional","affiliation":[{"name":"Boston College"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021819679600009X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1614431.1614435"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376925"},{"key":"e_1_3_2_1_4_1","volume-title":"Tree Languages Defined in First-Order Logic with One Quantifier Alternation. Logical Methods in Computer Science 6, 4","author":"Bojanczyk Mikolaj","year":"2010","unstructured":"Mikolaj Bojanczyk and Luc Segoufin. 2010. Tree Languages Defined in First-Order Logic with One Quantifier Alternation. Logical Methods in Computer Science 6, 4 (2010)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(3:26)2012"},{"key":"e_1_3_2_1_6_1","volume-title":"Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science 8, 3","author":"Boja\u0144czyk Mikolaj","year":"2012","unstructured":"Mikolaj Boja\u0144czyk, Howard Straubing, and Igor Walukiewicz. 2012. Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science 8, 3 (2012)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(73)80005-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"S. Eilenberg and B. Tilson. 1976. Automata languages and machines. Academic Pr New York.","DOI":"10.5555\/540244"},{"key":"e_1_3_2_1_9_1","unstructured":"Andreas Krebs and Howard Straubing. 2012. An effective characterization of the alternation hierarchy in two-variable logic. In FSTTCS. 86--98."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(88)90097-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_24"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.17"},{"key":"e_1_3_2_1_13_1","volume-title":"ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II (Lecture Notes in Computer Science), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.)","volume":"8573","author":"Place Thomas","year":"2014","unstructured":"Thomas Place and Marc Zeitoun. 2014. Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. In Automata, Languages, and Programming -41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II (Lecture Notes in Computer Science), Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias (Eds.), Vol. 8573. Springer, 342--353."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646619.697546"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1523429"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(85)90062-3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2013039"},{"key":"e_1_3_2_1_18_1","volume-title":"arXiv","author":"Straubing Howard","year":"1801","unstructured":"Howard Straubing. 2018. Forest Categories. arXiv: 1801.04337 {cs} (Jan. 2018). arXiv: 1801.04337."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(85)90071-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2868.2871"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(87)90108-3"}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE-CS\\DATC IEEE Computer Society","EACSL European Association for Computer Science Logic"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209158","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:29:27Z","timestamp":1781854167000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":21,"alternative-id":["10.1145\/3209108.3209158","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209158","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}