{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:01:50Z","timestamp":1767927710761,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130885","type":"print"},{"value":"9783642130892","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_29","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T12:05:27Z","timestamp":1273233927000},"page":"344-355","source":"Crossref","is-referenced-by-count":10,"title":["The Copying Power of Well-Nested Multiple Context-Free Grammars"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Kanazawa","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Salvati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0022-0000(76)80032-3","volume":"13","author":"A. Arnold","year":"1976","unstructured":"Arnold, A., Dauchet, M.: Un th\u00e9orem de duplication pour les for\u00eats alg\u00e9briques. Journal of Computer and System Science\u00a013, 223\u2013244 (1976)","journal-title":"Journal of Computer and System Science"},{"key":"29_CR2","first-page":"273","volume":"11","author":"A. Ehrenfeucht","year":"1977","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On some context-free languages that are not deterministic ET0L languages. R.A.I.R.O. Informatique th\u00e9orique\/Theoretical Computer Science\u00a011, 273\u2013291 (1977)","journal-title":"R.A.I.R.O. Informatique th\u00e9orique\/Theoretical Computer Science"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J. Engelfriet","year":"1980","unstructured":"Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. Journal of Computer and System Sciences\u00a020, 150\u2013202 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0020-0190(76)90086-7","volume":"4","author":"J. Engelfriet","year":"1976","unstructured":"Engelfriet, J., Skyum, S.: Copying theorems. Information Processing Letters\u00a04, 157\u2013161 (1976)","journal-title":"Information Processing Letters"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Fisher, M.J.: Grammars with Macro-Like Productions. Ph.D. thesis, Harvard University (1968)","DOI":"10.1109\/SWAT.1968.12"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.2977\/prims\/1195192738","volume":"9","author":"T. Hayashi","year":"1973","unstructured":"Hayashi, T.: On derivation trees of indexed gramamrs \u2014an extension of the uvwxy-theorem\u2014. Publications of the Research Institute for Mathematical Sciences\u00a09, 61\u201392 (1973)","journal-title":"Publications of the Research Institute for Mathematical Sciences"},{"key":"29_CR7","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, 205\u2013253 (1996)","journal-title":"Thoretical Computer Science"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207169108804010","volume":"40","author":"M. Ito","year":"1991","unstructured":"Ito, M., Katsura, M.: Context-free languages consisting of non-primitive words. International Journal of Computer Mathematics\u00a040, 157\u2013167 (1991)","journal-title":"International Journal of Computer Mathematics"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1017\/CBO9780511597855.007","volume-title":"Natural Language Parsing: Psychological, Computational and Theoretical Perspectives","author":"A.K. Joshi","year":"1985","unstructured":"Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? In: Dowty, D.R., Karttunen, L., Zwicky, A.M. (eds.) Natural Language Parsing: Psychological, Computational and Theoretical Perspectives, pp. 206\u2013250. Cambridge University Press, Cambridge (1985)"},{"key":"29_CR10","unstructured":"Kanazawa, M.: The convergence of well-nested mildly context-sensitive grammar formalisms. In: An invited talk given at the 14th Conference on Formal Grammar, Bordeaux, France (July 2009), http:\/\/research.nii.ac.jp\/~kanazawa\/"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/978-3-642-02737-6_25","volume-title":"Developments in Language Theory: 13th International Conference, DLT 2009","author":"M. Kanazawa","year":"2009","unstructured":"Kanazawa, M.: The pumping lemma for well-nested multiple context-free languages. In: Diekert, V., Nowotka, D. (eds.) Developments in Language Theory: 13th International Conference, DLT 2009, pp. 312\u2013325. Springer, Berlin (2009)"},{"key":"29_CR12","unstructured":"Kuhlmann, M.: Dependency Structures and Lexicalized Grammars. Ph.D. thesis, Saarland University (2007)"},{"key":"29_CR13","first-page":"101","volume-title":"Proceedings of FG-MoL 2005: The 10th conference on Formal Grammar and the 9th Meeting on Mathematics of Language","author":"J. Michaelis","year":"2009","unstructured":"Michaelis, J.: An additional observation on strict derivational minimalism. In: Rogers, J. (ed.) Proceedings of FG-MoL 2005: The 10th conference on Formal Grammar and the 9th Meeting on Mathematics of Language, pp. 101\u2013111. CSLI Publications, Stanford (2009)"},{"key":"29_CR14","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, 87\u2013120 (1999)","journal-title":"Theoretical Computer Science"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0890-5401(87)90012-5","volume":"74","author":"B. Rozoy","year":"1987","unstructured":"Rozoy, B.: The Dyck language D\u20321 \u2009\u2217\u2009 is not generated by any matrix grammar of finite index. Information and Computation\u00a074, 64\u201389 (1987)","journal-title":"Information and Computation"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jcss.1997.1515","volume":"56","author":"G. Satta","year":"1998","unstructured":"Satta, G.: Trading independent for synchronized parallelism in finite copying parallel rewriting systems. Journal of Computer and System Sciences\u00a056, 27\u201345 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1093\/ietisy\/e91-d.2.209","volume":"E91\u2013D","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\u2013D, 209\u2013221 (2008)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H. Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science\u00a088, 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"key":"29_CR19","volume-title":"A Second Course in Formal Langauges and Automata Theory","author":"J. Shallit","year":"2009","unstructured":"Shallit, J.: A Second Course in Formal Langauges and Automata Theory. Cambridge University Press, Cambridge (2009)"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Staudacher, P.: New frontiers beyond context-freeness: DI-grammars and DI-automata. In: 6th Conference of the European Chapter of the Association for Computational Linguistics (EACL \u201993), pp. 358\u2013367 (1993)","DOI":"10.3115\/976744.976786"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: 25th Annual Meeting of the Association for Computational Linguistics, pp. 104\u2013111 (1987)","DOI":"10.3115\/981175.981190"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13089-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:00Z","timestamp":1606186860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}