{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:31:45Z","timestamp":1794378705035,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141614","type":"print"},{"value":"9783642141621","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_15","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:26:21Z","timestamp":1278307581000},"page":"175-186","source":"Crossref","is-referenced-by-count":10,"title":["On Erasing Productions in Random Context Grammars"],"prefix":"10.1007","author":[{"given":"Georg","family":"Zetzsche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-88282-4_13","volume-title":"Language and Automata Theory and Applications","author":"H. Bordihn","year":"2008","unstructured":"Bordihn, H., Holzer, M.: Random context in regulated rewriting versus cooperating distributed grammar systems. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 125\u2013136. Springer, Heidelberg (2008)"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-3-540-39886-8_13","volume-title":"Formal Languages and Applications","author":"J. Dassow","year":"2004","unstructured":"Dassow, J.: Grammars with regulated rewriting. In: Mart\u00edn-Vide, C., Mitrana, V., P\u0103un, G. (eds.) Formal Languages and Applications, pp. 249\u2013273. Springer, Berlin (2004)"},{"key":"15_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, Berlin (1989)"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-3-662-07675-0_3","volume-title":"Handbook of Formal Languages","author":"J. Dassow","year":"1997","unstructured":"Dassow, J., P\u0103un, G., Salomaa, A.: Grammars with controlled derivations. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a02, pp. 101\u2013154. Springer, Berlin (1997)"},{"key":"15_CR5","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0270, 959\u2013967 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"15_CR6","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/BF01178731","volume":"31","author":"D. Hauschildt","year":"1994","unstructured":"Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrix grammars. Acta Informatica\u00a031(8), 719\u2013728 (1994)","journal-title":"Acta Informatica"},{"key":"15_CR7","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"15_CR8","first-page":"66","volume-title":"Information Processing 71, Proceedings of the IFIP Congress 71, Foundations and Systems","author":"A. Walt van der","year":"1972","unstructured":"van der Walt, A.: Random context languages. In: Information Processing 71, Proceedings of the IFIP Congress 71, Foundations and Systems, vol.\u00a01, pp. 66\u201368. North-Holland, Amsterdam (1972)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/978-3-642-02737-6_40","volume-title":"DLT 2009","author":"G. Zetzsche","year":"2009","unstructured":"Zetzsche, G.: Erasing in Petri Net Languages and Matrix Grammars. In: Diekert, V., Nowotka, D. (eds.) DLT 2009, Stuttgart, Germany, June 30\u2013July 3. LNCS, vol.\u00a05583, pp. 490\u2013501. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:37:26Z","timestamp":1558280246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_15","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}