{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:14Z","timestamp":1750307414659,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806757","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"485-494","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["The HOM problem is decidable"],"prefix":"10.1145","author":[{"given":"Guillem","family":"Godoy","sequence":"first","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya (UPC), Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Gim\u00e9nez","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lander","family":"Ramos","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carme","family":"\u00c0lvarez","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/280474"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646791.704539"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646508.694491"},{"key":"e_1_3_2_1_4_1","volume-title":"Tree automata techniques and applications.","author":"Comon H.","year":"2007","unstructured":"H. Comon , M. Dauchet , R. Gilleron , C. L\u00f6ding , F. Jacquemard , D. Lugiez , S. Tison , and M. Tommasi . Tree automata techniques and applications. Available at http:\/\/www.grappa.univ-lille3.fr\/tata, 2007 . H. Comon, M. Dauchet, R. Gilleron, C. L\u00f6ding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available at http:\/\/www.grappa.univ-lille3.fr\/tata, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1056"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646510.694976"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788843"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1995.1048"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01704020"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90241-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.03.033"},{"key":"e_1_3_2_1_12_1","volume-title":"Akad\u00e9miai Kiad\u00f3","author":"G\u00e9cseg F.","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby . Tree Automata . Akad\u00e9miai Kiad\u00f3 , 1984 . F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, 1984."},{"key":"e_1_3_2_1_13_1","first-page":"1","volume-title":"Handbook of Formal Languages","author":"G\u00e9cseg F.","year":"1997","unstructured":"F. G\u00e9cseg and M. Steinby . Tree languages . In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages , volume 3 , pages 1 -- 68 . Springer-Verlag , 1997 . F. G\u00e9cseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1--68. Springer-Verlag, 1997."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/112102.112115"},{"key":"e_1_3_2_1_15_1","unstructured":"G. Godoy O. Gim\u00e9nez L. Ramos and C. \u00c0lvarez. The hom problem is decidable. Available at www.lsi.upc.edu\/ggodoy\/publications.html.  G. Godoy O. Gim\u00e9nez L. Ramos and C. \u00c0lvarez. The hom problem is decidable. Available at www.lsi.upc.edu\/ggodoy\/publications.html."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1779782.1779797"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792803.1792813"},{"key":"e_1_3_2_1_18_1","first-page":"287","volume-title":"Third International Workshop on Conditional Term Rewriting Systems (CTRS)","author":"Hofbauer D.","year":"1992","unstructured":"D. Hofbauer and M. Huber . Computing linearizations using test sets . In Third International Workshop on Conditional Term Rewriting Systems (CTRS) , pages 287 -- 301 , 1992 . D. Hofbauer and M. Huber. Computing linearizations using test sets. In Third International Workshop on Conditional Term Rewriting Systems (CTRS), pages 287--301, 1992."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00982-2_38"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1054"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.003"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80017-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691346"},{"key":"e_1_3_2_1_24_1","first-page":"197","article-title":"For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable","volume":"48","author":"V\u00e1gv\u00f6lgyi S.","year":"1992","unstructured":"S. V\u00e1gv\u00f6lgyi and R. Gilleron . For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable . Bulletin of the EATCS , 48 : 197 -- 209 , 1992 . S. V\u00e1gv\u00f6lgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. Bulletin of the EATCS, 48:197--209, 1992.","journal-title":"Bulletin of the EATCS"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"STOC'10"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806757","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":24,"alternative-id":["10.1145\/1806689.1806757","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806757","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}