{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:55:13Z","timestamp":1725692113441},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316432"},{"type":"electronic","value":"9783642316449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-31644-9_11","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T22:17:08Z","timestamp":1342649828000},"page":"160-173","source":"Crossref","is-referenced-by-count":5,"title":["One-Sided Random Context Grammars with Leftmost Derivations"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Meduna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Zemek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A.V. Aho","year":"2006","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, Boston (2006)","edition":"2"},{"key":"11_CR2","series-title":"Parsing","volume-title":"The Theory of Parsing, Translation and Compiling","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation and Compiling. Parsing, vol.\u00a0I. Prentice-Hall, New Jersey (1972)"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0019-9958(74)80038-0","volume":"24","author":"B.S. Baker","year":"1974","unstructured":"Baker, B.S.: Non-context-free grammars generating context-free languages. Information and Control\u00a024(3), 231\u2013246 (1974)","journal-title":"Information and Control"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/S0019-9958(75)90426-X","volume":"29","author":"R.L. Cannon","year":"1975","unstructured":"Cannon, R.L.: Phrase structure grammars generating context-free languages. Information and Control\u00a029(3), 252\u2013267 (1975)","journal-title":"Information and Control"},{"key":"11_CR5","unstructured":"Cojocaru, L., M\u00e4kinen, E.: On the complexity of Szilard languages of regulated grammars. Tech. rep., Department of Computer Sciences, University of Tampere, Tampere, Finland (2010)"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(73)90008-2","volume":"2","author":"A.B. Cremers","year":"1973","unstructured":"Cremers, A.B., Maurer, H.A., Mayer, O.: A note on leftmost restricted random context grammars. Information Processing Letters\u00a02(2), 31\u201333 (1973)","journal-title":"Information Processing Letters"},{"key":"11_CR7","volume-title":"Crafting a Compiler","author":"R. Cytron","year":"2009","unstructured":"Cytron, R., Fischer, C., LeBlanc, R.: Crafting a Compiler. Addison-Wesley, Boston (2009)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1142\/S012905419900006X","volume":"10","author":"J. Dassow","year":"1999","unstructured":"Dassow, J., Fernau, H., P\u0103un, G.: On the leftmost derivation in matrix grammars. International Journal of Foundations of Computer Science\u00a010(1), 61\u201380 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. Springer, New York (1989)"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1009954606346","volume":"3","author":"H. Fernau","year":"2000","unstructured":"Fernau, H.: Regulated grammars under leftmost derivation. Grammars\u00a03(1), 37\u201362 (2000)","journal-title":"Grammars"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-3975(02)00656-4","volume":"296","author":"H. Fernau","year":"2003","unstructured":"Fernau, H.: Nonterminal complexity of programmed grammars. Theoretical Computer Science\u00a0296(2), 225\u2013251 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0304-3975(02)00581-9","volume":"301","author":"C. Ferretti","year":"2003","unstructured":"Ferretti, C., Mauri, G., P\u0103un, G., Zandron, C.: On three variants of rewriting P systems. Theoretical Computer Science\u00a0301(1-3), 201\u2013215 (2003)","journal-title":"Theoretical Computer Science"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-36490-0_17","volume-title":"Membrane Computing","author":"R. Freund","year":"2003","unstructured":"Freund, R., Oswald, M.: P Systems with Activated\/Prohibited Membrane Channels. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 261\u2013269. Springer, Heidelberg (2003)"},{"issue":"2","key":"11_CR14","first-page":"159","volume":"2","author":"S. Ginsburg","year":"1968","unstructured":"Ginsburg, S., Spanier, E.H.: Control sets on grammars. Theory of Computing Systems\u00a02(2), 159\u2013177 (1968)","journal-title":"Theory of Computing Systems"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/S0022-0000(70)80045-9","volume":"4","author":"T. Kasai","year":"1970","unstructured":"Kasai, T.: An hierarchy between context-free and context-sensitive languages. Journal of Computer and System Sciences\u00a04, 492\u2013508 (1970)","journal-title":"Journal of Computer and System Sciences"},{"issue":"15","key":"11_CR16","first-page":"175","volume":"2006","author":"R. Luk\u00e1\u0161","year":"2006","unstructured":"Luk\u00e1\u0161, R., Meduna, A.: Multigenerative grammar systems. Schedae Informaticae\u00a02006(15), 175\u2013188 (2006)","journal-title":"Schedae Informaticae"},{"issue":"1","key":"11_CR17","first-page":"317","volume":"11","author":"M. Luker","year":"1977","unstructured":"Luker, M.: A generalization of leftmost derivations. Theory of Computing Systems\u00a011(1), 317\u2013325 (1977)","journal-title":"Theory of Computing Systems"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/S0019-9958(64)90406-1","volume":"7","author":"G.H. Matthews","year":"1964","unstructured":"Matthews, G.H.: A note on asymmetry in phrase structure grammars. Information and Control\u00a07, 360\u2013365 (1964)","journal-title":"Information and Control"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/S0019-9958(73)90627-X","volume":"23","author":"H. Maurer","year":"1973","unstructured":"Maurer, H.: Simple matrix languages with a leftmost restriction. Information and Control\u00a023(2), 128\u2013139 (1973)","journal-title":"Information and Control"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-62844-4_3","volume-title":"New Trends in Formal Languages","author":"A. Meduna","year":"1997","unstructured":"Meduna, A.: On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. In: P\u0103un, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol.\u00a01218, pp. 27\u201338. Springer, Heidelberg (1997)"},{"key":"11_CR21","doi-asserted-by":"crossref","DOI":"10.1201\/9781420063257","volume-title":"Elements of Compiler Design","author":"A. Meduna","year":"2007","unstructured":"Meduna, A.: Elements of Compiler Design. Auerbach Publications, Boston (2007)"},{"key":"11_CR22","first-page":"144","volume-title":"MEMICS 2009: 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science","author":"A. Meduna","year":"2009","unstructured":"Meduna, A., Goldefus, F.: Weak leftmost derivations in cooperative distributed grammar systems. In: MEMICS 2009: 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, pp. 144\u2013151. Brno University of Technology, Brno (2009)"},{"issue":"389","key":"11_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2007.07.044","volume":"2007","author":"A. Meduna","year":"2007","unstructured":"Meduna, A., Techet, J.: Canonical scattered context generators of sentences with their parses. Theoretical Computer Science\u00a02007(389), 73\u201381 (2007)","journal-title":"Theoretical Computer Science"},{"key":"11_CR24","volume-title":"Scattered Context Grammars and their Applications","author":"A. Meduna","year":"2010","unstructured":"Meduna, A., Techet, J.: Scattered Context Grammars and their Applications. WIT Press, Southampton (2010)"},{"key":"11_CR25","unstructured":"Meduna, A., \u0160krkal, O.: Combined leftmost derivations in matrix grammars. In: ISIM 2004: Proceedings of 7th International Conference on Information Systems Implementation and Modelling, Ostrava, CZ, pp. 127\u2013132 (2004)"},{"issue":"2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00236-012-0150-6","volume":"49","author":"A. Meduna","year":"2012","unstructured":"Meduna, A., Zemek, P.: Nonterminal complexity of one-sided random context grammars. Acta Informatica\u00a049(2), 55\u201368 (2012)","journal-title":"Acta Informatica"},{"issue":"3","key":"11_CR27","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00236-011-0134-y","volume":"48","author":"A. Meduna","year":"2011","unstructured":"Meduna, A., Zemek, P.: One-sided random context grammars. Acta Informatica\u00a048(3), 149\u2013163 (2011)","journal-title":"Acta Informatica"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/9789814447133_0018","volume-title":"Mathematical Aspects of Natural and Formal Languages","author":"V. Mihalache","year":"1994","unstructured":"Mihalache, V.: Matrix grammars versus parallel communicating grammar systems. In: Mathematical Aspects of Natural and Formal Languages, pp. 293\u2013318. World Scientific Publishing, River Edge (1994)"},{"key":"11_CR29","first-page":"187","volume":"3","author":"M. Mutyam","year":"2007","unstructured":"Mutyam, M., Krithivasan, K.: Tissue P systems with leftmost derivation. Ramanujan Mathematical Society Lecture Notes Series\u00a03, 187\u2013196 (2007)","journal-title":"Ramanujan Mathematical Society Lecture Notes Series"},{"issue":"9","key":"11_CR30","first-page":"751","volume":"30","author":"G. P\u0103un","year":"1985","unstructured":"P\u0103un, G.: On leftmost derivation restriction in regulated rewriting. Romanian Journal of Pure and Applied Mathematics\u00a030(9), 751\u2013758 (1985)","journal-title":"Romanian Journal of Pure and Applied Mathematics"},{"issue":"1","key":"11_CR31","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/321495.321504","volume":"16","author":"D.J. Rosenkrantz","year":"1969","unstructured":"Rosenkrantz, D.J.: Programmed grammars and classes of formal languages. Journal of the ACM\u00a016(1), 107\u2013131 (1969)","journal-title":"Journal of the ACM"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1 through 3. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-59126-6"},{"issue":"2","key":"11_CR33","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0019-9958(72)90332-4","volume":"20","author":"A. Salomaa","year":"1972","unstructured":"Salomaa, A.: Matrix grammars with a leftmost restriction. Information and Control\u00a020(2), 143\u2013149 (1972)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Languages Alive"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31644-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:16:32Z","timestamp":1556925392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31644-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316432","9783642316449"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31644-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}