{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T10:00:18Z","timestamp":1794391218519,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642223204","type":"print"},{"value":"9783642223211","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22321-1_39","type":"book-chapter","created":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T23:58:48Z","timestamp":1310687928000},"page":"452-463","source":"Crossref","is-referenced-by-count":2,"title":["A Sufficient Condition for Erasing Productions to Be Avoidable"],"prefix":"10.1007","author":[{"given":"Georg","family":"Zetzsche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A.V. Aho","year":"1968","unstructured":"Aho, A.V.: Indexed grammars\u2014an extension of context-free grammars. Journal of the ACM\u00a015, 647\u2013671 (1968)","journal-title":"Journal of the ACM"},{"issue":"1","key":"39_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(73)90917-0","volume":"23","author":"A.B. Cremers","year":"1973","unstructured":"Cremers, A.B., Mayer, O.: On matrix languages. Information and Control\u00a023(1), 86\u201396 (1973)","journal-title":"Information and Control"},{"key":"39_CR3","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, Berlin (1989)"},{"key":"39_CR4","doi-asserted-by":"publisher","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)"},{"issue":"14","key":"39_CR5","first-page":"2808","volume":"15","author":"J. Dassow","year":"2009","unstructured":"Dassow, J., Turaev, S.: Petri net controlled grammars: the case of special petri nets. Journal of Universal Computer Science\u00a015(14), 2808\u20132835 (2009)","journal-title":"Journal of Universal Computer Science"},{"issue":"2","key":"39_CR6","first-page":"191","volume":"12","author":"J. Dassow","year":"2009","unstructured":"Dassow, J., Turaev, S.: Petri net controlled grammars: the power of labeling and final markings. Romanian Journal of Information Science and Technology\u00a012(2), 191\u2013207 (2009)","journal-title":"Romanian Journal of Information Science and Technology"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0304-3975(01)00282-1","volume":"276","author":"H. Fernau","year":"2002","unstructured":"Fernau, H., Stiebe, R.: Sequential grammars and automata with valences. Theoretical Computer Science\u00a0276, 377\u2013405 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01692513","volume":"2","author":"S. Ginsburg","year":"1968","unstructured":"Ginsburg, S., Spanier, E.H.: Control sets on grammars. Mathematical Systems Theory\u00a02(2), 159\u2013177 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"39_CR9","unstructured":"Salomaa, A.: On grammars with restricted use of productions. Annales Academi\u00e6 Scientiarum Fennic\u00e6. Series A I. Mathematica 454 (1969)"},{"key":"39_CR10","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.\u00a06199, pp. 175\u2013186. Springer, Heidelberg (2010)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0129054111008118","volume":"22","author":"G. Zetzsche","year":"2011","unstructured":"Zetzsche, G.: Toward understanding the generative capacity of erasing rules in matrix grammars. International Journal of Foundations of Computer Science\u00a022, 411\u2013426 (2011)","journal-title":"International Journal of Foundations of Computer Science"}],"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-642-22321-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T23:50:20Z","timestamp":1553903420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_39","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-22321-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":[[2011]]}}}