{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:35Z","timestamp":1750306355035,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"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":[[2016,7,5]]},"DOI":"10.1145\/2933575.2934504","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"227-236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings"],"prefix":"10.1145","author":[{"given":"Arnaud","family":"Carayol","sequence":"first","affiliation":[{"name":"LIGM (Univ. Paris Est & CNRS)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Serre","sequence":"additional","affiliation":[{"name":"IRIF (Univ. Paris Diderot & CNRS)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.28"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646508.694491"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","volume-title":"FoSSaCS'99, Proceedings","author":"Bogaert B.","year":"1999","unstructured":"B. Bogaert , F. Seynhaeve , and S. Tison . The recognizability problem for tree automata with comparisons between brothers . In FoSSaCS'99, Proceedings , volume 1578 of LNCS . Springer , 1999 . B. Bogaert, F. Seynhaeve, and S. Tison. The recognizability problem for tree automata with comparisons between brothers. In FoSSaCS'99, Proceedings, volume 1578 of LNCS. Springer, 1999."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30124-0_7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9279-2"},{"key":"e_1_3_2_1_6_1","first-page":"38","volume-title":"Proceedings of Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014","volume":"8573","author":"Bojanczyk M.","year":"2014","unstructured":"M. Bojanczyk . Weak MSO+U with path quantifiers over infinite trees . In Proceedings of Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014 , volume 8573 of LNCS, pages 38 -- 49 . Springer Berlin Heidelberg , 2014 . M. Bojanczyk. Weak MSO+U with path quantifiers over infinite trees. In Proceedings of Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, volume 8573 of LNCS, pages 38--49. Springer Berlin Heidelberg, 2014."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004141"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_33"},{"key":"e_1_3_2_1_9_1","first-page":"215","volume-title":"27th Annual Conference of the EACSL (CSL 2013)","volume":"23","author":"Colcombet T.","year":"2013","unstructured":"T. Colcombet , D. Kuperberg , C. L\u00f6ding , and M. Vanden Boom . Deciding the weak definability of b\u00fcchi definable tree languages. In \"Proceedings of Computer Science Logic , 27th Annual Conference of the EACSL (CSL 2013) \", volume 23 of LIPIcs, pages 215 -- 230 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 2013 . T. Colcombet, D. Kuperberg, C. L\u00f6ding, and M. Vanden Boom. Deciding the weak definability of b\u00fcchi definable tree languages. In \"Proceedings of Computer Science Logic, 27th Annual Conference of the EACSL (CSL 2013)\", volume 23 of LIPIcs, pages 215--230. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2013."},{"key":"e_1_3_2_1_10_1","unstructured":"H. Comon M. Dauchet R. Gilleron C. L\u00f6ding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. Tree automata techniques and applications. http:\/\/tata.gforge.inria.fr\/ 2007. release October 12th 2007.  H. Comon M. Dauchet R. Gilleron C. L\u00f6ding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. Tree automata techniques and applications. http:\/\/tata.gforge.inria.fr\/ 2007. release October 12th 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392389.2392406"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85780-8_25"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/S012905411000743X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501600"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806757"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00214-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54345-7_80"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75293"},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin M. O.","year":"1969","unstructured":"M. O. Rabin . Decidability of second-order theories and automata on infinite trees . Transactions of the American Mathematical Society , 141 : 1 -- 35 , 1969 . M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141: 1--35, 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/013","volume-title":"Automata on infinite objects and Church's problem","author":"Rabin M. O.","year":"1972","unstructured":"M. O. Rabin . Automata on infinite objects and Church's problem . American Mathematical Society , Providence, R.I. , 1972 . Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics, No. 13. M. O. Rabin. Automata on infinite objects and Church's problem. American Mathematical Society, Providence, R.I., 1972. Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics, No. 13."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"},{"key":"e_1_3_2_1_23_1","first-page":"580","volume-title":"Proceedings of Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011","author":"Boom M. Vanden","year":"2011","unstructured":"M. Vanden Boom . Weak cost monadic logic over infinite trees . In Proceedings of Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011 , pages 580 -- 591 , 2011 . M. Vanden Boom. Weak cost monadic logic over infinite trees. In Proceedings of Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, pages 580--591, 2011."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00009-7"}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"New York NY USA","acronym":"LICS '16"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2934504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:03Z","timestamp":1750222563000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":24,"alternative-id":["10.1145\/2933575.2934504","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2934504","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}