{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:27Z","timestamp":1725456027297},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057879X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017490","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:11Z","timestamp":1132645631000},"page":"308-321","source":"Crossref","is-referenced-by-count":0,"title":["A rank hierarchy for deterministic tree-walking transducers"],"prefix":"10.1007","author":[{"given":"Owen","family":"Rambow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Satta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0022-0000(69)80018-8","volume":"3","author":"A. V. Aho","year":"1969","unstructured":"A. V. Aho and J. D. Ullman. Properties of syntax directed translations. Journal of Computer and System Science, 3(3):319\u2013334, 1969.","journal-title":"Journal of Computer and System Science"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","volume":"19","author":"A. V. Aho","year":"1971","unstructured":"A. V. Aho and J. D. Ullman. Translations on a context-free grammar. Information and Control, 19:439\u2013475, 1971.","journal-title":"Information and Control"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20:83\u2013127, 1987.","journal-title":"Mathematical Systems Theory"},{"key":"21_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"J. Dassow and G. Paun. Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin, Germany, 1989."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","volume":"43","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet and L. Heyker. The string generating power of context-free hypergraph grammars. Journal of Computer and System Science, 43:328\u2013360, 1991.","journal-title":"Journal of Computer and System Science"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"J. Engelfriet, G. Rozenberg, and G. Slutzki. Tree transducers, L systems, and two-way machines. Journal of Computer and System Science, 20:150\u2013202, 1980.","journal-title":"Journal of Computer and System Science"},{"key":"21_CR7","volume-title":"Technical report","author":"O. Rambow","year":"1994","unstructured":"O. Rambow and G. Satta. A two-dimensional hierarchy for finite copying parallel rewriting systems. Technical report, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, PA, 1994."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H. Seki","year":"1991","unstructured":"H. Seki, T. Matsumura, M. Fujii, and T. Kasami. On multiple context-free grammars. Theoretical Computer Science, 88:191\u2013229, 1991.","journal-title":"Theoretical Computer Science"},{"key":"21_CR9","first-page":"143","volume-title":"Currents in the Theory of Computing","author":"J. W. Thatcher","year":"1973","unstructured":"J. W. Thatcher. Tree automata: An informal survey. In A. V. Aho, editor, Currents in the Theory of Computing, chapter 4, pages 143\u2013172. Prentice-Hall, Englewood Cliffs, NJ, 1973."},{"key":"21_CR10","unstructured":"D. J. Weir. Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, 1988."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"D. J. Weir. Linear context-free rewriting systems and deterministic tree-walk transducers. In Proc. of the 30 th Meeting of the Association for Computational Linguistics (ACL'92), Newark, Delaware, 1992.","DOI":"10.3115\/981967.981985"}],"container-title":["Lecture Notes in Computer Science","Trees in Algebra and Programming \u2014 CAAP'94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017490.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:40Z","timestamp":1607549920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057879X"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0017490","relation":{},"subject":[]}}