{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:40:27Z","timestamp":1725561627612},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143212"},{"type":"electronic","value":"9783642143229"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14322-9_11","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T06:01:06Z","timestamp":1280383266000},"page":"129-144","source":"Crossref","is-referenced-by-count":0,"title":["The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Kepser","sequence":"first","affiliation":[]},{"given":"James","family":"Rogers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J., Schmidt, E.M.: IO and OI. I. Journal of Computer and System Sciences\u00a015(3), 328\u2013353 (1977)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.ipl.2004.10.008","volume":"93","author":"A. Fujiyoshi","year":"2005","unstructured":"Fujiyoshi, A.: Linearity and nondeletion on monadic context-free tree grammars. Information Processing Letters\u00a093(3), 103\u2013107 (2005)","journal-title":"Information Processing Letters"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s002249910004","volume":"33","author":"A. Fujiyoshi","year":"2000","unstructured":"Fujiyoshi, A., Kasai, T.: Spinal-formed context-free tree grammars. Theory of Computing Systems\u00a033(1), 59\u201383 (2000)","journal-title":"Theory of Computing Systems"},{"key":"11_CR4","series-title":"Beyond Words","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol.\u00a03, pp. 1\u201368. Springer, Heidelberg (1997)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A. Joshi","year":"1975","unstructured":"Joshi, A., Levy, L.S., Takahashi, M.: Tree adjunct grammar. Journal of Computer and System Sciences\u00a010(1), 136\u2013163 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of Formal Languages, Handbook of Formal Languages","author":"A. Joshi","year":"1997","unstructured":"Joshi, A., Schabes, Y.: Tree adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Handbook of Formal Languages. Beyond Words, vol.\u00a03, pp. 69\u2013123. Springer, Berlin (1997)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1111\/j.1467-8640.1994.tb00011.x","volume":"10","author":"B. Lang","year":"1994","unstructured":"Lang, B.: Recognition can be harder than parsing. Computational Intelligence\u00a010, 486\u2013494 (1994)","journal-title":"Computational Intelligence"},{"key":"11_CR8","volume-title":"Strong Generative Capacity: The Semantics of Linguistic Formalism","author":"P.H. Miller","year":"1999","unstructured":"Miller, P.H.: Strong Generative Capacity: The Semantics of Linguistic Formalism. CSLI Publications, Stanford (1999)"},{"key":"11_CR9","unstructured":"M\u00f6nnich, U.: Adjunction as substitution. In: Kruijff, G.J., Morill, G., Oehrle, R. (eds.) Formal Grammar 1997, pp. 169\u2013178 (1997)"},{"key":"11_CR10","volume-title":"A Descriptive Approach to Language-Theoretic Complexity","author":"J. Rogers","year":"1998","unstructured":"Rogers, J.: A Descriptive Approach to Language-Theoretic Complexity. CSLI Publications, Stanford (1998)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(01)00349-8","volume":"293","author":"J. Rogers","year":"2003","unstructured":"Rogers, J.: wMSO theories as grammar formalisms. Theoretical Computer Science\u00a0293(2), 291\u2013320 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","The Mathematics of Language"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14322-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:51:04Z","timestamp":1606168264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14322-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143212","9783642143229"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14322-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}