{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:57:11Z","timestamp":1771952231848,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662531310","type":"print"},{"value":"9783662531327","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_12","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"138-150","source":"Crossref","is-referenced-by-count":6,"title":["An Automata Characterisation for Multiple Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Denkinger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/321526.321529","volume":"16","author":"AV Aho","year":"1969","unstructured":"Aho, A.V.: Nested stack automata. JACM 16(3), 383\u2013406 (1969)","journal-title":"JACM"},{"key":"12_CR2","volume-title":"Handbook of Mathematical Psychology","author":"N Chomsky","year":"1962","unstructured":"Chomsky, N.: Formal properties of grammars. In: Luce, R.D., Bush, R.R., Galanter, E. (eds.) Handbook of Mathematical Psychology, vol. 2. Wiley, New York (1962)"},{"key":"12_CR3","unstructured":"Villemonte de la Clergerie, \u00c9.: Parsing MCS languages with thread automata. In: Proceedings of TAG+02, pp. 101\u2013108 (2002)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Villemonte de la Clergerie, \u00c9.: Parsing mildly context-sensitive languages with thread automata. In: Proceedings of COLING 2002, vol. 1, pp. 1\u20137. ACL (2002)","DOI":"10.3115\/1072228.1072256"},{"key":"12_CR5","unstructured":"Engelfriet, J.: Context-free grammars with storage. CoRR (2014)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown tree automata. Math. Syst. Theor. 16(1), 237\u2013263 (1983)","journal-title":"Math. Syst. Theor."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-23021-4_11","volume-title":"Algebraic Informatics","author":"L Herrmann","year":"2015","unstructured":"Herrmann, L., Vogler, H.: A Chomsky-Sch\u00fctzenberger theorem for weighted automata with storage. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 115\u2013127. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-23021-4_11"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Kennedy, K., Warren, S.K.: Automatic generation of efficient evaluators for attribute grammars. In: Proceedings of POPL 1976 (1976)","DOI":"10.1145\/800168.811538"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Kuhlmann, M., Satta, G.: Treebank grammar techniques for non-projective dependency parsing. In: Proceedings of EACL 2009, pp. 478\u2013486. ACL (2009)","DOI":"10.3115\/1609067.1609120"},{"key":"12_CR10","unstructured":"Maier, W.: Direct parsing of discontinuous constituents in German. In: Proceedings of SPMRL 2010, pp. 58\u201366. ACL (2010)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","volume":"6","author":"MP Sch\u00fctzenberger","year":"1963","unstructured":"Sch\u00fctzenberger, M.P.: On context-free languages and push-down automata. Inf. Control 6(3), 246\u2013264 (1963)","journal-title":"Inf. Control"},{"issue":"2","key":"12_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0022-0000(67)80014-X","volume":"1","author":"D Scott","year":"1967","unstructured":"Scott, D.: Some definitional suggestions for automata theory. J. Comput. Syst. Sci. 1(2), 187\u2013212 (1967)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"12_CR13","doi-asserted-by":"crossref","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. TCS 88(2), 191\u2013229 (1991)","journal-title":"TCS"},{"key":"12_CR14","unstructured":"Vijay-Shanker, K.: A study of tree adjoining grammars. Ph.D. thesis (1988)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:45:56Z","timestamp":1498315556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}