乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:01:56Z","timestamp":1648789316335},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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":[[1998,3]]},"DOI":"10.1016\/s0304-3975(96)00332-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"57-85","source":"Crossref","is-referenced-by-count":1,"title":["Compositions with superlinear deterministic top-down tree transformations"],"prefix":"10.1016","volume":"194","author":[{"given":"G.","family":"D\u00e1nyi","sequence":"first","affiliation":[]},{"given":"Z.","family":"F\u00fcl\u00f6p","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00332-5_BIB1","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 transductions","volume":"41","author":"Baker","year":"1979","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(96)00332-5_BIB2","series-title":"String-Rewriting Systems","author":"Book","year":"1993"},{"key":"10.1016\/S0304-3975(96)00332-5_BIB3","series-title":"A Course in Universal Algebra","author":"Burris","year":"1981"},{"key":"10.1016\/S0304-3975(96)00332-5_BIB4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF01184813","article-title":"Superlinear deterministic top-down tree transducers","volume":"29","author":"D\u00e1nyi","year":"1996","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(96)00332-5_BIB5","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\/S0304-3975(96)00332-5_BIB6","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\/S0304-3975(96)00332-5_BIB7","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\/S0304-3975(96)00332-5_BIB8","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\/S0304-3975(96)00332-5_BIB9","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\/S0304-3975(96)00332-5_BIB10","first-page":"153","article-title":"An infinite hierarchy of tree transformations in the class NDR","volume":"8","author":"F\u00fcl\u00f6p","year":"1987","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(96)00332-5_BIB11","first-page":"55","article-title":"On domains of tree transducers","volume":"34","author":"F\u00fcl\u00f6p","year":"1988","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(96)00332-5_BIB12","series-title":"Proc. 2nd Conf. on Automata, Languages, and Programming Systems","article-title":"A finite presentation for a monoid of tree transformation classes","author":"F\u00fcl\u00f6p","year":"1988"},{"key":"10.1016\/S0304-3975(96)00332-5_BIB13","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\/S0304-3975(96)00332-5_BIB14","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\/S0304-3975(96)00332-5_BIB15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(94)00303-3","article-title":"Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations","volume":"156","author":"Gyenizse","year":"1996","journal-title":"Theort. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00332-5_BIB16","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\/S0304-3975(96)00332-5_BIB17","series-title":"Confluent String Rewriting","author":"Jantzen","year":"1988"},{"key":"10.1016\/S0304-3975(96)00332-5_BIB18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","article-title":"Mapping on grammars and trees","volume":"4","author":"Rounds","year":"1970","journal-title":"Math. Systems. Theory"},{"key":"10.1016\/S0304-3975(96)00332-5_BIB19","series-title":"Proc. FCT'93","first-page":"440","article-title":"A hierarchy of deterministic top-down tree transformation","volume":"Vol. 710","author":"Slutzki","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003325?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003325?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:00:18Z","timestamp":1555405218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596003325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0304397596003325"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00332-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}