{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:43Z","timestamp":1725905443028},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_12","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:37:57Z","timestamp":1500525477000},"page":"173-184","source":"Crossref","is-referenced-by-count":2,"title":["On the Power of Permitting Semi-conditional Grammars"],"prefix":"10.1007","author":[{"given":"Zsolt","family":"Gazdag","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kriszti\u00e1n","family":"Tichler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"12_CR1","unstructured":"Bordihn, H., Fernau, H.: Accepting grammars and systems: an overview. In: Developments in Language Theory, Magdeburg, Germany (1995)"},{"issue":"1","key":"12_CR2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.jcss.2011.05.008","volume":"78","author":"J Dassow","year":"2012","unstructured":"Dassow, J., Masopust, T.: On restricted context-free grammars. J. Comput. Syst. Sci. 78(1), 293\u2013304 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR3","doi-asserted-by":"crossref","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":"4","key":"12_CR4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with \n            $$n$$\n           distinct prime factors. Am. J. Math. 35(4), 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"issue":"1\u20132","key":"12_CR5","first-page":"149","volume":"237","author":"S Ewert","year":"2000","unstructured":"Ewert, S., van der Walt, A.: A shrinking lemma for random forbidding context languages. Theor. Comput. Sci. 237(1\u20132), 149\u2013158 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"12_CR6","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/S0304-3975(01)00171-2","volume":"270","author":"S Ewert","year":"2002","unstructured":"Ewert, S., van der Walt, A.: A pumping lemma for random permitting context languages. Theor. Comput. Sci. 270(1\u20132), 959\u2013967 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR7","unstructured":"Gazdag, Z.: A note on context-free grammars with rewriting restrictions. In: Brodnik, A., Galambos, G. (eds.) Proceedings of the 2010 Mini-Conference on Applied Theoretical Computer Science. University of Primorska Press, Koper (2011)"},{"issue":"1\u20134","key":"12_CR8","first-page":"81","volume":"19","author":"Z Gazdag","year":"2014","unstructured":"Gazdag, Z.: Remarks on some simple variants of random context grammars. J. Autom. Lang. Comb. 19(1\u20134), 81\u201392 (2014)","journal-title":"J. Autom. Lang. Comb."},{"key":"12_CR9","unstructured":"Gazdag, Z., Tichler, K.: On the power of permitting semi-conditional grammars, extended version. \nhttps:\/\/www.researchgate.net\/publication\/312587701_On_the_Power_of_Permitting_Semi-conditional_Grammars"},{"issue":"1","key":"12_CR10","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 3(1), 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1017\/CBO9780511597855.007","volume-title":"Natural Language Parsing","author":"AK 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, pp. 206\u2013250. Cambridge University Press, Cambridge (1985)"},{"key":"12_CR12","volume-title":"Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition","author":"D Jurafsky","year":"2000","unstructured":"Jurafsky, D., Martin, J.H.: Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition. Prentice Hall PTR, Upper Saddle River, NJ, USA (2000)"},{"key":"12_CR13","unstructured":"Kelemen, J.: Conditional grammars: motivations, definitions, and some properties. In: Proceedings of the Conference on Automata, Languages and Mathematical Sciences, Salg\u00f3tarj\u00e1n, pp. 110\u2013123 (1984)"},{"issue":"2","key":"12_CR14","first-page":"210","volume":"95","author":"JB Kruskal","year":"1960","unstructured":"Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi\u2019s conjecture. Trans. Am. Math. Soc. 95(2), 210\u2013225 (1960)","journal-title":"Trans. Am. Math. Soc."},{"issue":"8","key":"12_CR15","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/j.jcss.2010.04.001","volume":"76","author":"T Masopust","year":"2010","unstructured":"Masopust, T.: Simple restriction in context-free rewriting. J. Comput. Syst. Sci. 76(8), 837\u2013846 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90056-8","volume":"41","author":"G P\u0103un","year":"1985","unstructured":"P\u0103un, G.: A variant of random context grammars: semi-conditional grammars. Theor. Comput. Sci. 41, 1\u201317 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR17","volume-title":"Formal Languages","author":"A Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York, London (1973)"},{"key":"12_CR18","first-page":"66","volume":"71","author":"A Walt van der","year":"1972","unstructured":"van der Walt, A.: Random context languages. Inf. Process. 71, 66\u201368 (1972)","journal-title":"Inf. Process."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-14162-1_15","volume-title":"Automata, Languages and Programming","author":"G Zetzsche","year":"2010","unstructured":"Zetzsche, G.: On erasing productions in random context grammars. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 175\u2013186. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-14162-1_15"}],"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-319-62809-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T04:40:57Z","timestamp":1500525657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}