{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:46Z","timestamp":1761610366228,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80532-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"40-54","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Rewriting in the partial algebra of typed terms modulo AC"],"prefix":"10.1016","volume":"68","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB1","series-title":"ICALP'96 volume 1099 of LNCS","first-page":"194","article-title":"On infinite transition graphs having a decidable monadic theory","author":"Caucal","year":"1996"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB2","doi-asserted-by":"crossref","unstructured":"D. Caucal. On infinite terms having a decidable monadic theory. In MFCS'02, 2002.","DOI":"10.1007\/3-540-45687-2_13"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB3","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata, 1997."},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02088013","article-title":"The monadic second-order logic of graphs, ii: Infinite graphs of bounded width","volume":"21","author":"Courcelle","year":"1989","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(95)00049-3","article-title":"The monadic second order logic of graphs ix: Machines and their behaviours","volume":"volume 151","author":"Courcelle","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB6","doi-asserted-by":"crossref","unstructured":"M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Fifth Annual IEEE Symposium on Logic in Computer Science, pages 242\u2013248, 1990.","DOI":"10.1109\/LICS.1990.113750"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB7","doi-asserted-by":"crossref","unstructured":"M. Hack. The recursive equivalence of the reachability problem and the liveness problem for petri nets and vector addition systems. In 15th annual symposium on switching and automata theory, New York, 1974.","DOI":"10.1109\/SWAT.1974.28"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB8","article-title":"Higher-order pushdown trees are easy","author":"Knapik","year":"2002","journal-title":"FOSSACS'02, LNCS"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB9","doi-asserted-by":"crossref","unstructured":"S. Kosaraju. Decidability of reachability in vector addition systems. In 14th Annual Symposium on Theory of Computing, 1982.","DOI":"10.1145\/800070.802201"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB10","first-page":"515","article-title":"Complement problems and tree automata in aclike theories","volume":"volume 665","author":"Lugiez","year":"1993"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB11","doi-asserted-by":"crossref","unstructured":"D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In Proc. 9th Int. Conf. Concurrency Theory (CONCUR'98), Nice, France, Sep. 1998, volume 1466, pages 50\u201366. Springer, 1998.","DOI":"10.1007\/BFb0055615"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB12","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","article-title":"An algorithm for the general petri net reachability problem","volume":"13","author":"Mayr","year":"1981","journal-title":"SIAM Journal on computing"},{"issue":"1","key":"10.1016\/S1571-0661(04)80532-2_NEWBIB13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1006\/inco.1999.2826","article-title":"Process rewrite systems","volume":"156","author":"Mayr","year":"2000","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","article-title":"The theory of ends, pushdown automata, and second-order logic","volume":"37","author":"Muller","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80532-2_NEWBIB15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","article-title":"Semigroups, presburger formulas and languages","volume":"16","author":"Spanier","year":"1966","journal-title":"Pacific J. Maths"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805322?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805322?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:51Z","timestamp":1761609951000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104805322"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80532-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rewriting in the partial algebra of typed terms modulo AC","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80532-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}