{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:05:58Z","timestamp":1746331558511,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441206"},{"type":"electronic","value":"9783662441213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44121-3_6","type":"book-chapter","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T10:36:46Z","timestamp":1404988606000},"page":"86-103","source":"Crossref","is-referenced-by-count":1,"title":["A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Kanazawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A.V. Aho","year":"1968","unstructured":"Aho, A.V.: Indexed grammars\u2014an extension of context-free grammars. Journal of the Association for Computing Machinery\u00a015(4), 647\u2013671 (1968)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"6_CR2","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, part I. The Journal of Computer and System Sciences\u00a015(3), 328\u2013353 (1977)","journal-title":"The Journal of Computer and System Sciences"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","volume":"43","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences\u00a043(2), 328\u2013360 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-94-009-1337-0_3","volume-title":"Natural Language Parsing and Linguistic Theories","author":"G. Gazdar","year":"1988","unstructured":"Gazdar, G.: Applicability of indexed grammars to natural languages. In: Reyle, U., Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theories, pp. 69\u201394. Reidel, Dordrecht (1988)"},{"key":"6_CR5","unstructured":"G\u00f3mez-Rodr\u00edguez, C., Kuhlmann, M., Satta, G.: Efficient parsing of well-nested linear context-free rewriting systems. In: Proceedings of Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL), Los Angeles, USA, pp. 276\u2013284 (2010)"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10849-004-2114-x","volume":"13","author":"P. Groote de","year":"2004","unstructured":"de Groote, P., Pogodalla, S.: On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information\u00a013(4), 421\u2013438 (2004)","journal-title":"Journal of Logic, Language and Information"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown tree automata. Mathematical Systems Theory\u00a016(1), 237\u2013263 (1983)","journal-title":"Mathematical Systems Theory"},{"key":"6_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-48199-0_12","volume-title":"Logical Aspects of Computational Linguistics","author":"H. Harkema","year":"2001","unstructured":"Harkema, H.: A characterization of minimalist languages. In: de Groote, P., Morrill, G., Retor\u00e9, C. (eds.) LACL 2001. LNCS (LNAI), vol.\u00a02099, pp. 193\u2013211. Springer, Heidelberg (2001)"},{"key":"6_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"1-2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(95)00114-X","volume":"161","author":"G. Hotz","year":"1996","unstructured":"Hotz, G., Pitsch, G.: On parsing coupled-context-free languages. Thoretical Computer Science\u00a0161(1-2), 205\u2013253 (1996)","journal-title":"Thoretical Computer Science"},{"key":"6_CR11","first-page":"31","volume-title":"Processing of Linguistic Structure","author":"A.K. Joshi","year":"1991","unstructured":"Joshi, A.K., Vijay-Shanker, K., Weir, D.: The convergence of mildly context-sensitive grammar formalisms. In: Sells, P., Shieber, S., Wasow, T. (eds.) Processing of Linguistic Structure, pp. 31\u201381. MIT Press, Cambridge (1991)"},{"key":"6_CR12","unstructured":"Kanazawa, M.: The convergence of well-nested mildly context-sensitive grammar formalisms. An invited talk given at the 14th Conference on Formal Grammar, Bordeaux, France (July 2009), http:\/\/research.nii.ac.jp\/~kanazawa\/talks\/fg2009_talk.pdf"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-02737-6_25","volume-title":"Developments in Language Theory","author":"M. Kanazawa","year":"2009","unstructured":"Kanazawa, M.: The pumping lemma for well-nested multiple context-free languages. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 312\u2013325. Springer, Heidelberg (2009)"},{"key":"6_CR14","unstructured":"Kanazawa, M.: Second-order abstract categorial grammars. Lecture notes for a course taught at ESSLLI 2009 (2009), http:\/\/research.nii.ac.jp\/~kanazawa\/publications\/esslli2009_lectures.pdf"},{"key":"6_CR15","unstructured":"Kanazawa, M.: Multi-dimensional trees and a Chomsky-Sch\u00fctzenberger-Weir representation theorem for simple context-free tree grammars. Journal of Logic and Computation (to appear)"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2005.11.024","volume":"354","author":"S. Kepser","year":"2006","unstructured":"Kepser, S., M\u00f6nnich, U.: Closure properties of linear context-free tree languages with an application to optimality theory. Theoretical Computer Science\u00a0354(1), 82\u201397 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10849-011-9134-0","volume":"20","author":"S. Kepser","year":"2011","unstructured":"Kepser, S., Rogers, J.: The equivalence of tree adjoining grammars and monadic linear context-free tree grammars. Journal of Logic, Language and Information\u00a020(3), 361\u2013384 (2011)","journal-title":"Journal of Logic, Language and Information"},{"key":"6_CR18","volume-title":"The Art of Computer Programming, Fundamental Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Fundamental Algorithms, 3rd edn., vol.\u00a0I. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"6_CR19","unstructured":"Maletti, A., Engelfriet, J.: Strong lexicalization of tree adjoining grammars. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, pp. 506\u2013515. Association for Computational Linguistics (2012)"},{"key":"6_CR20","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-45738-0_11","volume-title":"Logical Aspects of Computational Linguistics","author":"J. Michaelis","year":"2001","unstructured":"Michaelis, J.: Derivational minimalism is mildly context-sensitive. In: Moortgat, M. (ed.) LACL 1998. LNCS (LNAI), vol.\u00a02014, pp. 179\u2013198. Springer, Heidelberg (2001)"},{"key":"6_CR21","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48199-0_14","volume-title":"Logical Aspects of Computational Linguistics","author":"J. Michaelis","year":"2001","unstructured":"Michaelis, J.: Transforming linear context-free rewriting systems into minimalist grammars. In: de Groote, P., Morrill, G., Retor\u00e9, C. (eds.) LACL 2001. LNCS (LNAI), vol.\u00a02099, pp. 228\u2013244. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(97)00190-4","volume":"223","author":"O. Rambow","year":"1999","unstructured":"Rambow, O., Satta, G.: Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science\u00a0223(1-2), 87\u2013120 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W. Rounds","year":"1970","unstructured":"Rounds, W.: Mappings and grammars on trees. Mathematical Systems Theory\u00a04(3), 257\u2013287 (1970)","journal-title":"Mathematical Systems Theory"},{"key":"6_CR24","unstructured":"Salvati, S.: Encoding second order string ACG with deterministic tree walking transducers. In: Wintner, S. (ed.) Proceedings of FG 2006: The 11th Conference on Formal Grammar, pp. 143\u2013156. FG Online Proceedings, CSLI Publications (2007)"},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1093\/ietisy\/e91-d.2.209","volume":"E91-D","author":"H. Seki","year":"2008","unstructured":"Seki, H., Kato, Y.: On the generative power of multiple context-free grammars and macro grammars. IEICE Transactions on Information and Systems\u00a0E91-D(2), 209\u2013221 (2008)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"6_CR26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6591.001.0001","volume-title":"The Syntactic Process","author":"M. Steedman","year":"2000","unstructured":"Steedman, M.: The Syntactic Process. MIT Press, Cambridge (2000)"},{"issue":"6","key":"6_CR27","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory\u00a027(6), 511\u2013546 (1994)","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"6_CR28","first-page":"591","volume":"19","author":"K. Vijay-Shanker","year":"1993","unstructured":"Vijay-Shanker, K., Weir, D.J.: Parsing some constrained grammar formalisms. Computational Linguistics\u00a019(4), 591\u2013636 (1993)","journal-title":"Computational Linguistics"},{"key":"6_CR29","unstructured":"Vijayashanker, K.: A Study of Tree Adjoining Grammars. Ph.D. thesis, University of Pennsylvania (1987)"},{"key":"6_CR30","unstructured":"Weir, D.J.: Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania (1988)"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Weir, D.J.: Linear context-free rewriting systems and deterministic tree-walking transducers. In: Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, pp. 136\u2013143 (1992)","DOI":"10.3115\/981967.981985"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44121-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:46:37Z","timestamp":1746297997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44121-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441206","9783662441213"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44121-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}