{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:03Z","timestamp":1742947203836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625351"},{"type":"electronic","value":"9783030625368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62536-8_19","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"231-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Insertion-Deletion with Substitutions II"],"prefix":"10.1007","author":[{"given":"Martin","family":"Vu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-3220","authenticated-orcid":false,"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Small size insertion and deletion systems. In: Martin-Vide, C. (ed.) Applications of Language Methods, pp. 459\u2013515. Imperial College Press (2010)","key":"19_CR1","DOI":"10.1142\/9781848165458_0009"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/cmb.1995.2.1","volume":"2","author":"D Beaver","year":"1995","unstructured":"Beaver, D.: Computing with DNA. J. Comput. Biol. 2(1), 1\u20137 (1995)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0255(83)90023-3","volume":"31","author":"D Haussler","year":"1983","unstructured":"Haussler, D.: Insertion languages. Inf. Sci. 31(1), 77\u201389 (1983)","journal-title":"Inf. Sci."},{"unstructured":"Kari, L.: On insertions and deletions in formal languages. Ph.D. thesis, University of Turku, Finland (1991)","key":"19_CR4"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF03024425","volume":"19","author":"L Karl","year":"1997","unstructured":"Karl, L.: DNA computing: arrival of biological mathematics. Math. Intell. 19(2), 9\u201322 (1997). https:\/\/doi.org\/10.1007\/BF03024425","journal-title":"Math. Intell."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-88282-4_31","volume-title":"Language and Automata Theory and Applications","author":"A Krassovitskiy","year":"2008","unstructured":"Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Further results on insertion-deletion systems with one-sided contexts. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 333\u2013344. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88282-4_31"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s11047-010-9208-y","volume":"10","author":"A Krassovitskiy","year":"2011","unstructured":"Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Computational power of insertion-deletion (P) systems with rules of size two. Nat. Comput. 10, 835\u2013852 (2011)","journal-title":"Nat. Comput."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.tcs.2004.06.031","volume":"330","author":"M Margenstern","year":"2005","unstructured":"Margenstern, M., P\u0103un, Gh., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2), 339\u2013348 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-74593-8_18","volume-title":"Machines, Computations, and Universality","author":"A Matveevici","year":"2007","unstructured":"Matveevici, A., Rogozhin, Y., Verlan, S.: Insertion-deletion systems with one-sided contexts. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 205\u2013217. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74593-8_18"},{"key":"19_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"Gh P\u0103un","year":"1998","unstructured":"P\u0103un, Gh., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-662-03563-4"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0019-9958(74)91049-3","volume":"25","author":"M Penttonen","year":"1974","unstructured":"Penttonen, M.: One-sided and two-sided context in formal grammars. Inf. Control (now Inf. Comput.) 25, 371\u2013392 (1974)","journal-title":"Inf. Control (now Inf. Comput.)"},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/B:NACO.0000006769.27984.23","volume":"2","author":"A Takahara","year":"2003","unstructured":"Takahara, A., Yokomori, T.: On the computational power of insertion-deletion systems. Nat. Comput. 2(4), 321\u2013336 (2003)","journal-title":"Nat. Comput."},{"issue":"2","key":"19_CR13","first-page":"210","volume":"18","author":"S Verlan","year":"2010","unstructured":"Verlan, S.: Recent developments on insertion-deletion systems. Comput. Sci. J. Moldova 18(2), 210\u2013245 (2010)","journal-title":"Comput. Sci. J. Moldova"},{"unstructured":"Vu, M.: On insertion-deletion systems with substitution rules. Master\u2019s thesis, Informatikwissenschaften, Universit\u00e4t Trier, Germany (2019)","key":"19_CR14"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-030-51466-2_33","volume-title":"Beyond the Horizon of Computability","author":"M Vu","year":"2020","unstructured":"Vu, M., Fernau, H.: Insertion-deletion systems with substitutions I. In: Anselmo, M., Della Vedova, G., Manea, F., Pauly, A. (eds.) CiE 2020. LNCS, vol. 12098, pp. 366\u2013378. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51466-2_33"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62536-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:48Z","timestamp":1741634568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}