{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:26:06Z","timestamp":1648898766795},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0890-5401(90)90054-l","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"195-212","source":"Crossref","is-referenced-by-count":4,"title":["A complete rewriting system for a monoid of tree transformation classes"],"prefix":"10.1016","volume":"86","author":[{"given":"Z.","family":"F\u00fcl\u00f6p","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"V\u00e1gv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90054-L_BIB1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(82)90098-6","article-title":"Morphismes et biomorphismes d'arbes","volume":"20","author":"Arnold","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90054-L_BIB2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(79)90561-8","article-title":"Composition of top-down and bottom-up tree tranducers","volume":"41","author":"Baker","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(90)90054-L_BIB3","first-page":"125","article-title":"Linear deterministic attributed transformations","volume":"6","author":"Bartha","year":"1983","journal-title":"Acta Cybernet."},{"key":"10.1016\/0890-5401(90)90054-L_BIB4","volume":"Vol. 277","author":"Beninghofen","year":"1987"},{"key":"10.1016\/0890-5401(90)90054-L_BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","article-title":"Confluent and other types of Thue systems","volume":"29","author":"Book","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90054-L_BIB6","series-title":"Progress in Combinatorics on Words","first-page":"1","article-title":"Thue systems and the Church-Rosser property: Replacement systems, specification of formal languages, and presentations of monoids","author":"Book","year":"1983"},{"key":"10.1016\/0890-5401(90)90054-L_BIB7_1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(82)90003-2","article-title":"Attribute grammars and recursive program schemes, I, II","volume":"17","author":"Courcelle","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90054-L_BIB7_2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(82)90024-X","article-title":"Attribute grammars and recursive program schemes, I, II","volume":"17","author":"Courcelle","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90054-L_BIB8","article-title":"Transductions de forests, bimorphisms de magmoides","author":"Dauchet","year":"1977"},{"key":"10.1016\/0890-5401(90)90054-L_BIB9_1","author":"Dauchet","year":"1987"},{"key":"10.1016\/0890-5401(90)90054-L_BIB9_2","series-title":"Proceedings, 2nd IEEE Symp. on Logic in Computer Science","author":"Dauchet","year":"1987"},{"key":"10.1016\/0890-5401(90)90054-L_BIB10","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","article-title":"Bottom-up and top-down tree transformations-A comparison","volume":"9","author":"Engelfriet","year":"1975","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(90)90054-L_BIB11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01683280","article-title":"Top-down tree transducers with regular look-ahead","volume":"10","author":"Engelfriet","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(90)90054-L_BIB12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0020-0190(78)90060-1","article-title":"On tree transducers for partial functions","volume":"7","author":"Engelfriet","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(90)90054-L_BIB13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01786975","article-title":"Three hierarchies of transducers","volume":"15","author":"Engelfriet","year":"1982","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(90)90054-L_BIB14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","article-title":"Macro tree transducers","volume":"31","author":"Engelfriet","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90054-L_BIB15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(86)90052-6","article-title":"Pushdown machines for the macro tree transducer","volume":"42","author":"Engelfriet","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90054-L_BIB16","author":"Engelfriet","year":"1988","journal-title":"Modular Tree Transducers"},{"key":"10.1016\/0890-5401(90)90054-L_BIB17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02915449","article-title":"High level tree transducers and iterated pushdown transducers","volume":"26","author":"Engelfriet","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(90)90054-L_BIB18","first-page":"163","article-title":"Decomposition results concerning K-visit attributed tree transducers","volume":"6","author":"F\u00fcl\u00f6p","year":"1983","journal-title":"Acta Cybernet."},{"key":"10.1016\/0890-5401(90)90054-L_BIB19","article-title":"A complete description for a monoid of deterministic bottom-up tree transformation classes","author":"F\u00fcl\u00f6p","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90054-L_BIB20","first-page":"49","article-title":"Results on compositions of deterministic root-to-frontier tree transformations","volume":"8","author":"F\u00fcl\u00f6p","year":"1987","journal-title":"Acta Cybernet."},{"key":"10.1016\/0890-5401(90)90054-L_BIB21","first-page":"259","article-title":"On ranges of compositions of deterministic root-to-frontier tree transformations","volume":"8","author":"F\u00fcl\u00f6p","year":"1988","journal-title":"Acta Cybernet."},{"key":"10.1016\/0890-5401(90)90054-L_BIB22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0020-0190(89)90178-6","article-title":"Top-down tree transducers with deterministic top-down look-ahead","volume":"33","author":"F\u00fcl\u00f6p","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(90)90054-L_BIB23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02088010","article-title":"Variants of top-down tree transducers with look-ahead","volume":"21","author":"F\u00fcl\u00f6p","year":"1989","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(90)90054-L_BIB24","article-title":"A complete classification of deterministic root-to-frontier tree transformation classes","author":"F\u00fcl\u00f6p","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90054-L_BIB25","series-title":"Proceedings, 2nd Conference on Automata, Laguages and Programming Systems","article-title":"A finite presentation for a monoid of tree transformation classes","author":"F\u00fcl\u00f6p","year":"1990"},{"key":"10.1016\/0890-5401(90)90054-L_BIB26","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/0890-5401(90)90054-L_BIB27","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","article-title":"Mappings and grammars on trees","volume":"4","author":"Rounds","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(90)90054-L_BIB28","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized2 sequential machine maps","volume":"4","author":"Thatcher","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90054-L_BIB29","first-page":"443","article-title":"On compositions of root-to-frontier tree transformations","volume":"7","author":"V\u00e1gv\u00f6lgyi","year":"1986","journal-title":"Acta Cybernet."},{"key":"10.1016\/0890-5401(90)90054-L_BIB30","first-page":"153","article-title":"An infinite hierarchy of tree transformations in the class NDR","volume":"8","author":"V\u00e1gv\u00f6lgyi","year":"1987","journal-title":"Acta Cybernet."},{"key":"10.1016\/0890-5401(90)90054-L_BIB31","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0022-0000(87)90007-9","article-title":"Basic tree transducers","volume":"34","author":"Vogler","year":"1987","journal-title":"J. Comput. System Sci."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090054L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090054L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:55Z","timestamp":1548897955000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090054L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["089054019090054L"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90054-l","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}