{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:41Z","timestamp":1725665801725},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"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-28332-1_32","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T09:45:36Z","timestamp":1330508736000},"page":"377-388","source":"Crossref","is-referenced-by-count":2,"title":["Computing by Observing Insertion"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Krassovitskiy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Leupold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Small Size Insertion and Deletion Systems. In: Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory. Scientific Applications of Language Methods, vol.\u00a02, pp. 459\u2013524. World Scientific (2010)","DOI":"10.1142\/9781848165458_0009"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11493785_1","volume-title":"DNA Computing","author":"A. Alhazov","year":"2005","unstructured":"Alhazov, A., Cavaliere, M.: Computing by Observing Bio-systems: The Case of Sticker Systems. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol.\u00a03384, pp. 1\u201313. Springer, Heidelberg (2005)"},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s11047-007-9062-8","volume":"9","author":"M. Cavaliere","year":"2009","unstructured":"Cavaliere, M., Jonoska, N., Leupold, P.: Recognizing DNA splicing. Natural Computing\u00a09(1), 157\u2013170 (2009)","journal-title":"Natural Computing"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-24619-0_6","volume-title":"Membrane Computing","author":"M. Cavaliere","year":"2004","unstructured":"Cavaliere, M., Leupold, P.: Evolution and Observation: A New Way to Look at Membrane Systems. In: Mart\u00edn-Vide, C., Mauri, G., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol.\u00a02933, pp. 70\u201387. Springer, Heidelberg (2004)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.tcs.2004.03.036","volume":"321","author":"M. Cavaliere","year":"2004","unstructured":"Cavaliere, M., Leupold, P.: Evolution and observation \u2014 a non-standard way to generate formal languages. Theoretical Computer Science\u00a0321, 233\u2013248 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"32_CR6","first-page":"447","volume":"74","author":"M. Cavaliere","year":"2006","unstructured":"Cavaliere, M., Leupold, P.: Observation of string-rewriting systems. Fundamenta Informaticae\u00a074(4), 447\u2013462 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Cavaliere, M., Leupold, P.: Computing by Observing Changes. In: Peper, F., Umeo, H., Matsui, N., Isokawa, T. (eds.) IWNC 2009. PICT, vol.\u00a02, pp. 133\u2013140. Springer, Heidelberg (2010)","DOI":"10.1007\/978-4-431-53868-4_15"},{"issue":"1-2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0304-3975(01)00096-2","volume":"270","author":"J. Dassow","year":"2002","unstructured":"Dassow, J., Mitrana, V., Salomaa, A.: Operations and language generating devices suggested by the genome evolution. Theor. Comput. Sci.\u00a0270(1-2), 701\u2013738 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR9","unstructured":"Galiukschov, B.S.: Semicontextual grammars. Matem. Logica i Matem. Lingvistika, 38\u201350 (1981) (in Russian)"},{"key":"32_CR10","unstructured":"Kari, L., P\u0103un, G., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. In: Proceedings of 3rd DIMACS Workshop on DNA Based Computing, Philadelphia, pp. 318\u2013333 (1997)"},{"issue":"1-3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.tcs.2008.01.037","volume":"396","author":"L. Kari","year":"2008","unstructured":"Kari, L., Sos\u00edk, P.: On the weight of universal insertion grammars. Theoretical Computer Science\u00a0396(1-3), 264\u2013270 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/inco.1996.0091","volume":"131","author":"L. Kari","year":"1996","unstructured":"Kari, L., Thierrin, G.: Contextual insertions\/deletions and computability. Information and Computation\u00a0131(1), 47\u201361 (1996)","journal-title":"Information and Computation"},{"key":"32_CR13","unstructured":"Krassovitskiy, A.: Complexity and Modeling Power of Insertion-Deletion Systems. Ph.D. thesis, Universitat Rovira i Virgili, Tarragona (2011)"},{"key":"32_CR14","volume-title":"DNA Computing \u2013 New Computing Paradigms","author":"G. P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing \u2013 New Computing Paradigms. Springer, Heidelberg (1998)"},{"key":"32_CR15","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:33:14Z","timestamp":1556425994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}