{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:31Z","timestamp":1760202511541},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":11462,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1016\/s0019-9958(82)90786-0","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"275-305","source":"Crossref","is-referenced-by-count":12,"title":["On the equivalence problem for attribute systems"],"prefix":"10.1016","volume":"52","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[]},{"given":"Paul","family":"Franchi-Zannettacci","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(82)90786-0_bib1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01744285","article-title":"An order-algebraic definition of Knuthian semantics","volume":"13","author":"Chirica","year":"1979","journal-title":"Math. System Theory"},{"key":"10.1016\/S0019-9958(82)90786-0_bib2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(78)90039-7","article-title":"A representation of trees by languages","volume":"7","author":"Courcelle","year":"1978","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0019-9958(82)90786-0_bib3","doi-asserted-by":"crossref","DOI":"10.1007\/BF01744577","article-title":"An Axiomatic Approach to the Korenjak-Hoperoft Algorithms","author":"Courcelle","year":"1983","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0019-9958(82)90786-0_bib4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(82)90003-2","article-title":"Attribute Grammars and Recursive Program Schemes","volume":"17","author":"Courcelle","year":"1982","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0019-9958(82)90786-0_bib5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0022-0000(76)80036-0","article-title":"Completeness results for the equivalence of recursive schemas","volume":"12","author":"Courcelle","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(82)90786-0_bib6","first-page":"7","article-title":"Combining T and Level-N","author":"Damm","year":"1981"},{"key":"10.1016\/S0019-9958(82)90786-0_bib7","article-title":"Recursive Procedures","volume":"24","author":"Debakker","year":"1971","journal-title":"Mathematical Center Tract"},{"key":"10.1016\/S0019-9958(82)90786-0_bib8","series-title":"Proc. Symp. on Formal Languages Theory","first-page":"241","article-title":"Some open questions and recent results on tree transducers and tree languages","author":"Engelfriet","year":"1980"},{"key":"10.1016\/S0019-9958(82)90786-0_bib9","article-title":"Attributs s\u00e9mantiques et sch\u00e9mas de programmes","author":"Franchi-Zannettacci","year":"1982"},{"key":"10.1016\/S0019-9958(82)90786-0_bib10","article-title":"Edinburgh LCF","volume":"Vol. 78","author":"Gordon","year":"1979"},{"key":"10.1016\/S0019-9958(82)90786-0_bib11","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent Reductions: Abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(82)90786-0_bib12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","article-title":"Semantics of context-free languages","volume":"2","author":"Knuth","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0019-9958(82)90786-0_bib13","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. on Prog. Lang. Systems"},{"key":"10.1016\/S0019-9958(82)90786-0_bib14","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/0210037","article-title":"Attribute grammars and mathematical semantics","volume":"10","author":"Mayoh","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(82)90786-0_bib15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","article-title":"The equivalence problem for deterministic finite turn pda's","volume":"25","author":"Valiant","year":"1974","journal-title":"Inform. Contr."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995882907860?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995882907860?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T13:30:33Z","timestamp":1548941433000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995882907860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["S0019995882907860"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(82)90786-0","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}