{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:24Z","timestamp":1760202624423},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T00:00:00Z","timestamp":1308614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10849-011-9134-0","type":"journal-article","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T02:22:35Z","timestamp":1308536555000},"page":"361-384","source":"Crossref","is-referenced-by-count":17,"title":["The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars"],"prefix":"10.1007","volume":"20","author":[{"given":"Stephan","family":"Kepser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim","family":"Rogers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"issue":"3","key":"9134_CR1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet J., Schmidt E. M. (1977) IO and OI. I. Journal of Computer and System Sciences 15(3): 328\u2013353","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"9134_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.ipl.2004.10.008","volume":"93","author":"A. Fujiyoshi","year":"2005","unstructured":"Fujiyoshi A. (2005) Linearity and nondeletion on monadic context-free tree grammars. Information Processing Letters 93(3): 103\u2013107. doi: 10.1016\/j.ipl.2004.10.008","journal-title":"Information Processing Letters"},{"issue":"1","key":"9134_CR3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s002249910004","volume":"33","author":"A. Fujiyoshi","year":"2000","unstructured":"Fujiyoshi A., Kasai T. (2000) Spinal-formed context-free tree grammars. Theory of Computing Systems 33(1): 59\u201383","journal-title":"Theory of Computing Systems"},{"key":"9134_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-59126-6_1","volume-title":"Handbook of formal languages, Vol. 3: Beyond words","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg F., Steinby M. (1997) Tree languages. In: Rozenberg G., Salomaa A. (eds) Handbook of formal languages, Vol. 3: Beyond words. Springer, Berlin, pp 1\u201368"},{"key":"9134_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of formal languages, Vol 3: Beyond words","author":"A. Joshi","year":"1997","unstructured":"Joshi A., Schabes Y. (1997) Tree adjoining grammars. In: Rozenberg G., Salomaa A. (eds) Handbook of formal languages, Vol 3: Beyond words. Springer, Berlin, pp 69\u2013123"},{"issue":"1","key":"9134_CR6","doi-asserted-by":"crossref","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. (1975) Tree adjunct grammar. Journal of Computer and System Sciences 10(1): 136\u2013163","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"9134_CR7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.tcs.2005.11.024","volume":"354","author":"S. Kepser","year":"2006","unstructured":"Kepser S., M\u00f6nnich U. (2006) Closure properties of linear context-free tree languages with an application to optimality theory. Theoretical Computer Science 354(1): 82\u201397","journal-title":"Theoretical Computer Science"},{"key":"9134_CR8","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1111\/j.1467-8640.1994.tb00011.x","volume":"10","author":"B. Lang","year":"1994","unstructured":"Lang B. (1994) Recognition can be harder than parsing. Computational Intelligence 10: 486\u2013494","journal-title":"Computational Intelligence"},{"key":"9134_CR9","volume-title":"Strong generative capacity: The semantics of linguistic formalism","author":"P. H. Miller","year":"1999","unstructured":"Miller P. H. (1999) Strong generative capacity: The semantics of linguistic formalism. CSLI Publications, Stanford"},{"key":"9134_CR10","unstructured":"M\u00f6nnich, U. (1997). Adjunction as substitution. In G. J. Kruijff, G. Morill & R. Oehrle (Eds.), Formal grammar \u201997 (pp. 169\u2013178)."},{"key":"9134_CR11","volume-title":"A descriptive approach to language-theoretic complexity","author":"J. Rogers","year":"1998","unstructured":"Rogers J. (1998) A descriptive approach to language-theoretic complexity. CSLI Publications, Stanford"},{"issue":"2","key":"9134_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0304-3975(01)00349-8","volume":"293","author":"J. Rogers","year":"2003","unstructured":"Rogers J. (2003) wMSO theories as grammar formalisms. Theoretical Computer Science 293(2): 291\u2013320","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-011-9134-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10849-011-9134-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-011-9134-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:31:02Z","timestamp":1559255462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10849-011-9134-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,21]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9134"],"URL":"https:\/\/doi.org\/10.1007\/s10849-011-9134-0","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,21]]}}}