{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:07Z","timestamp":1760202607799},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130885"},{"type":"electronic","value":"9783642130892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_50","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T08:05:27Z","timestamp":1273219527000},"page":"596-607","source":"Crossref","is-referenced-by-count":5,"title":["Chomsky-Sch\u00fctzenberger-Type Characterization of Multiple Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Yoshinaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Kaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 118\u2013161. North Holland, Amsterdam (1963)"},{"key":"50_CR2","volume-title":"Handbook of formal languages","author":"J. Engelfriet","year":"1997","unstructured":"Engelfriet, J.: Context-free graph grammars. In: Handbook of formal languages, vol.\u00a03, Springer, Heidelberg (1997)"},{"unstructured":"Kaji, Y.: Universal recognition problems and a representation theorem using dyck-type languages for multiple context-free grammars. Bachelor\u2019s thesis, Osaka University (1991)","key":"50_CR3"},{"key":"50_CR4","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.) Developments in Language Theory. LNCS, vol.\u00a05583, pp. 312\u2013325. Springer, Heidelberg (2009)"},{"key":"50_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BFb0022257","volume-title":"Computer Science Logic","author":"C. Lautemann","year":"1995","unstructured":"Lautemann, C., Schwentick, T., Th\u00e9rien, D.: Logics for context-free languages. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 205\u2013216. Springer, Heidelberg (1995)"},{"issue":"1-2","key":"50_CR6","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":"2","key":"50_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1093\/ietisy\/e91-d.2.209","volume":"91-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\u00a091-D(2), 209\u2013221 (2008)","journal-title":"IEICE Transactions"},{"issue":"2","key":"50_CR8","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(2), 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"key":"50_CR9","volume-title":"Handbook of formal languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of formal languages, vol.\u00a03. Springer, Heidelberg (1997)"}],"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_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:54:42Z","timestamp":1619769282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}