{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:01:32Z","timestamp":1648645292996},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":6347,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0304-3975(94)00303-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"71-97","source":"Crossref","is-referenced-by-count":4,"title":["Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations"],"prefix":"10.1016","volume":"156","author":[{"given":"P\u00e1l","family":"Gyenizse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1nder","family":"V\u00e1gv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00303-3_BIB1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","article-title":"Bottom-up and top-down tree transformations \u2014 a comparison","volume":"9","author":"Engelfriet","year":"1975","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)00303-3_BIB2","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\/0304-3975(94)00303-3_BIB3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(91)90376-D","article-title":"A complete description for a monoid of deterministic bottom-up tree transformation classes","volume":"88","author":"F\u00fcl\u00f6p","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00303-3_BIB4","first-page":"443","article-title":"On compositions of root-to-frontier tree transformations","volume":"7","author":"F\u00fcl\u00f6p","year":"1986","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(94)00303-3_BIB5","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\/0304-3975(94)00303-3_BIB6","series-title":"Proc. 2nd Conf. on Automata, Languages and Programming Systems","first-page":"115","article-title":"A finite presentation for a monoid of tree transformation classes","author":"F\u00fcl\u00f6p","year":"1988"},{"key":"10.1016\/0304-3975(94)00303-3_BIB7","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\/0304-3975(94)00303-3_BIB8","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\/0304-3975(94)00303-3_BIB9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0890-5401(90)90054-L","article-title":"A complete rewriting system for a monoid of tree transformation classes","volume":"86","author":"F\u00fcl\u00f6p","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)00303-3_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90312-P","article-title":"A complete classification of deterministic root-to-frontier tree transformation classes","volume":"81","author":"F\u00fcl\u00f6p","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00303-3_BIB11","series-title":"Tree Automata and Languages","first-page":"381","article-title":"Decidability of the inclusion in monoids generated by tree transformation classes","author":"F\u00fcl\u00f6p","year":"1992"},{"key":"10.1016\/0304-3975(94)00303-3_BIB12","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/0304-3975(94)00303-3_BIB13_1","series-title":"Proc. FCT'93","first-page":"440","article-title":"A hierarchy of deterministic top-down tree transformations","volume":"Vol. 710","author":"Slutzki","year":"1993"},{"key":"10.1016\/0304-3975(94)00303-3_BIB13_2","unstructured":"also Math. Systems Theory, to appear."},{"key":"10.1016\/0304-3975(94)00303-3_BIB14","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594003033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594003033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:52:46Z","timestamp":1555404766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594003033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0304397594003033"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00303-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}