{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:00:10Z","timestamp":1725534010320},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027369"},{"type":"electronic","value":"9783642027376"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_40","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T12:40:30Z","timestamp":1246365630000},"page":"490-501","source":"Crossref","is-referenced-by-count":4,"title":["Erasing in Petri Net Languages and Matrix Grammars"],"prefix":"10.1007","author":[{"given":"Georg","family":"Zetzsche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","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. Springer, Heidelberg (1997)"},{"key":"40_CR2","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 matrixgrammars. Acta Informatica\u00a031, 719\u2013728 (1994)","journal-title":"Acta Informatica"},{"key":"40_CR3","unstructured":"Dassow, J., Turaev, S.: Arbitrary Petri net controlled grammars. In: Bel-Enguix, G., Jim\u00e9nez-L\u00f3pez, M.D. (eds.) Proc. 2nd International Workshop ForLing 2008, Tarragona, Spain, pp. 27\u201339 (2008)"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-642-00982-2_28","volume-title":"LATA 2009","author":"J. Dassow","year":"2009","unstructured":"Dassow, J., Turaev, S.: Grammars controlled by special Petri nets. In: Dediu, A.-H., Ionescu, A.-M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 326\u2013337. Springer, Heidelberg (2009)"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-662-40087-6_7","volume-title":"GI - 4. Jahrestagung","author":"M. H\u00f6ppner","year":"1975","unstructured":"H\u00f6ppner, M.: Eine Charakterisierung der Szilardsprachen und ihre Verwendung als Steuersprachen. In: Siefkes, D. (ed.) GI 1974. LNCS, vol.\u00a026, pp. 113\u2013121. Springer, Heidelberg (1975)"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Greibach, S.A.: Remarks on blind and partially blind multicounter machines. Theoretical Computer Science, 311\u2013324 (1978)","DOI":"10.1016\/0304-3975(78)90020-8"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45523-X_7","volume-title":"Multiset Processing","author":"M. Kudlek","year":"2001","unstructured":"Kudlek, M., Mart\u00edn-Vide, C., P\u0103un, G.: Toward a formal macroset theory. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol.\u00a02235, pp. 123\u2013133. Springer, Heidelberg (2001)"},{"issue":"3","key":"40_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput.\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"40_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, Heidelberg (1989)"}],"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-02737-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T04:25:20Z","timestamp":1558412720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}