{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:25Z","timestamp":1725558985992},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540257837"},{"type":"electronic","value":"9783540319535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11422532_12","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T22:15:43Z","timestamp":1278972943000},"page":"177-188","source":"Crossref","is-referenced-by-count":4,"title":["A Polynomial Time Extension of Parallel Multiple Context-Free Grammar"],"prefix":"10.1007","author":[{"given":"Peter","family":"Ljungl\u00f6f","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","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., Matsumara, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science\u00a088, 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1023\/A:1005376413354","volume":"20","author":"A. Groenink","year":"1997","unstructured":"Groenink, A.: Mild context-sensitivity and tuple-based generalizations of context-free grammar. Linguistics and Philosophy\u00a020, 607\u2013636 (1997)","journal-title":"Linguistics and Philosophy"},{"unstructured":"Groenink, A.: Surface without Structure \u2014 Word order and tractability issues in natural language analysis. PhD thesis, Utrecht University (1997)","key":"12_CR3"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1009907814595","volume":"3","author":"P. Boullier","year":"2000","unstructured":"Boullier, P.: A cubic-time extension of context-free grammars. Grammars\u00a03, 111\u2013131 (2000)","journal-title":"Grammars"},{"unstructured":"Boullier, P.: Range concatenation grammars. In: 6th International Workshop on Parsing Technologies, Trento, Italy, pp. 53\u201364 (2000)","key":"12_CR5"},{"key":"12_CR6","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics\u00a06, 519\u2013535 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"unstructured":"Pollard, C.: Generalised Phrase Structure Grammars, Head Grammars and Natural Language. PhD thesis, Stanford University (1984)","key":"12_CR7"},{"unstructured":"Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania, Philadelphia, PA (1988)","key":"12_CR8"},{"unstructured":"Becker, T.: HyTAG: A New Type of Tree Adjoining Grammars. PhD thesis, Universit\u00e4t des Saarlandes (1994)","key":"12_CR9"},{"doi-asserted-by":"crossref","unstructured":"Chiang, D.: Constraints on strong generative power. In: 39th Meeting of the Association for Computational Linguistics, pp. 124\u2013131 (2001)","key":"12_CR10","DOI":"10.3115\/1073012.1073030"},{"unstructured":"Ljungl\u00f6f, P.: Expressivity and Complexity of the Grammatical Framework. PhD thesis, G\u00f6teborg University (2004)","key":"12_CR11"},{"unstructured":"Kasami, T., Seki, H., Fujii, M.: Generalized context-free grammars and multiple context-free grammars. IEICE Transactions J71-D-I, 758\u2013765 (1988)","key":"12_CR12"},{"unstructured":"Bertsch, E., Nederhof, M.J.: On the complexity of some extensions of RCG parsing. In: 7th International Workshop on Parsing Technologies, pp. 66\u201377 (2001)","key":"12_CR13"},{"key":"12_CR14","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"12_CR15","volume-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"S. Ginsburg","year":"1975","unstructured":"Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland\/Elsevier, Amsterdam (1975)"},{"unstructured":"Chiang, D.: Evaluating Grammar Formalisms for Applications to Natural Language Processing and Biological Sequence Analysis. PhD thesis, University of Pennsylvania (2004)","key":"12_CR16"},{"doi-asserted-by":"crossref","unstructured":"Satta, G.: Recognition of linear context-free rewriting systems. In: 30th Meeting of the Association for Computational Linguistics, Newark, Delaware, pp. 89\u201395 (1992)","key":"12_CR17","DOI":"10.3115\/981967.981979"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11422532_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:04:07Z","timestamp":1619492647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422532_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540257837","9783540319535"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11422532_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}