{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:57:28Z","timestamp":1743101848132,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"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_5","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Power of Generalized Forbidding Insertion-Deletion Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-3220","authenticated-orcid":false,"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2358-905X","authenticated-orcid":false,"given":"Lakshmanan","family":"Kuppusamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0981-9165","authenticated-orcid":false,"given":"Indhumathi","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)","DOI":"10.1515\/9783112737873"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-030-11509-8_15","volume-title":"Algorithms and Discrete Applied Mathematics","author":"H Fernau","year":"2019","unstructured":"Fernau, H., Kuppusamy, L., Oladele, R.O., Raman, I.: Improved descriptional complexity results on generalized forbidding grammars. In: Pal, S.P., Vijayakumar, A. (eds.) CALDAM 2019. LNCS, vol. 11394, pp. 174\u2013188. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11509-8_15"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s11047-019-09742-w","volume":"18","author":"H Fernau","year":"2019","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1). Nat. Comput. 18(3), 563\u2013577 (2019). https:\/\/doi.org\/10.1007\/s11047-019-09742-w","journal-title":"Nat. Comput."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Freund, R., Kogler, M., Rogozhin, Y., Verlan, S.: Graph-controlled insertion-deletion systems. In: McQuillan, I., Pighizzini, G. (eds.) Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, DCFS. EPTCS, vol. 31, pp. 88\u201398 (2010)","DOI":"10.4204\/EPTCS.31.11"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1051\/ita\/1991250504731","volume":"25","author":"V Geffert","year":"1991","unstructured":"Geffert, V.: Normal forms for phrase-structure grammars. RAIRO Informatique th\u00e9orique et Applications\/Theor. Inform. Appl. 25, 473\u2013498 (1991)","journal-title":"RAIRO Informatique th\u00e9orique et Applications\/Theor. Inform. Appl."},{"issue":"1","key":"5_CR6","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."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.3233\/FI-2015-1203","volume":"138","author":"S Ivanov","year":"2015","unstructured":"Ivanov, S., Verlan, S.: Random context and semi-conditional insertion-deletion systems. Fundamenta Informaticae 138, 127\u2013144 (2015)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR8","unstructured":"Kari, L.: On insertions and deletions in formal languages. Ph.D. thesis, University of Turku, Finland (1991)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Kari, L., P\u0103un, Gh., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: characterizing recursively enumerable languages using insertion-deletion systems. In: Rubin, H., Wood, D.H. (eds.) DNA Based Computers III. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 48, pp. 329\u2013338 (1999)","DOI":"10.1090\/dimacs\/048\/23"},{"issue":"2","key":"5_CR10","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":"5_CR11","unstructured":"Masopust, T., Meduna, A.: Descriptional complexity of generalized forbidding grammars. In: Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007, pp. 170\u2013177, July 2007"},{"key":"5_CR12","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":"5_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1080\/00207169008803908","volume":"36","author":"A Meduna","year":"1990","unstructured":"Meduna, A.: Generalized forbidding grammars. Int. J. Comput. Math. 36, 31\u201339 (1990)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1080\/00207160304666","volume":"80","author":"A Meduna","year":"2003","unstructured":"Meduna, A., Svec, M.: Descriptional complexity of generalized forbidding grammars. Int. J. Comput. Math. 80(1), 11\u201317 (2003)","journal-title":"Int. J. Comput. Math."},{"key":"5_CR15","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and Foundations of Mathematics, vol. 125. North Holland, Amsterdam (1989)"},{"key":"5_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-48523-6_9","volume-title":"ICALP 1999","author":"G Rozenberg","year":"1998","unstructured":"Rozenberg, G., Salomaa, A.: DNA computing: new ideas and paradigms. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 106\u2013118. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-48523-6_9"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2012.07.002","volume":"456","author":"I Petre","year":"2012","unstructured":"Petre, I., Verlan, S.: Matrix insertion-deletion systems. Theor. Comput. Sci. 456, 80\u201388 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"5_CR18","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). https:\/\/doi.org\/10.1023\/B:NACO.0000006769.27984.23","journal-title":"Nat. Comput."}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:50Z","timestamp":1741634570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_5","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"}}]}}