{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:09:31Z","timestamp":1743145771996,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411132"},{"type":"electronic","value":"9783319411149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41114-9_9","type":"book-chapter","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T10:05:14Z","timestamp":1467021914000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[]},{"given":"Lakshmanan","family":"Kuppusamy","sequence":"additional","affiliation":[]},{"given":"Indhumathi","family":"Raman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"issue":"1\u20132","key":"9_CR1","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tcs.2010.08.025","volume":"412","author":"A Alhazov","year":"2011","unstructured":"Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: P systems with minimal insertion and deletion. Theoret. Comput. Sci. 412(1\u20132), 136\u2013144 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR2","series-title":"Series in Molecular Biology","volume-title":"RNA Editing: The Alteration of Protein Coding Sequences of RNA","year":"1993","unstructured":"Benne, R. (ed.): RNA Editing: The Alteration of Protein Coding Sequences of RNA. Series in Molecular Biology. Ellis Horwood, Chichester (1993)"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2007.07.030","volume":"387","author":"F Biegler","year":"2007","unstructured":"Biegler, F., Burrell, M.J., Daley, M.: Regulated RNA rewriting: modelling RNA editing with guided insertion. Theoret. Comput. Sci. 387(2), 103\u2013112 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The Algebraic Theory of Context-Free Languages. Studies in Logic and the Foundations of Mathematics, pp. 118\u2013161. North-Holland, Amsterdam (1970)","DOI":"10.1016\/S0049-237X(09)70104-1"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.4204\/EPTCS.31.11","volume":"31","author":"Rudolf Freund","year":"2010","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)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"5\/6","key":"9_CR6","first-page":"303","volume":"27","author":"V Geffert","year":"1991","unstructured":"Geffert, V.: How to generate languages using only two pairs of parentheses. J. Inf. Process. Cybern. EIK 27(5\/6), 303\u2013315 (1991)","journal-title":"J. Inf. Process. Cybern. EIK"},{"issue":"1","key":"9_CR7","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":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-54239-8_16","volume-title":"Membrane Computing","author":"S Ivanov","year":"2014","unstructured":"Ivanov, S., Verlan, S.: About one-sided one-symbol insertion-deletion P systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 225\u2013237. Springer, Heidelberg (2014)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-23111-2_6","volume-title":"Machines, Computations, and Universality - 7th International Conference, MCU","author":"S Ivanov","year":"2015","unstructured":"Ivanov, S., Verlan, S.: Universality of graph-controlled leftist insertion-deletion systems with two states. In: Durand-Lose, J., Nagy, B. (eds.) Machines, Computations, and Universality - 7th International Conference, MCU. LNCS, vol. 9288, pp. 79\u201393. Springer, Switzerland (2015)"},{"key":"9_CR10","unstructured":"Kari, L.: On insertion and deletion in formal languages. Ph.D. thesis, University of Turku, Finland (1991)"},{"issue":"1","key":"9_CR11","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. Inf. Comput. 131(1), 47\u201361 (1996)","journal-title":"Inf. Comput."},{"key":"9_CR12","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."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-19056-8_23","volume-title":"Distributed Computing and Internet Technology","author":"L Kuppusamy","year":"2011","unstructured":"Kuppusamy, L., Mahendran, A., Krishna, S.N.: Matrix insertion-deletion systems for bio-molecular structures. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol. 6536, pp. 301\u2013312. Springer, Heidelberg (2011)"},{"key":"9_CR14","unstructured":"Kuppusamy, L., Rama, R.: On the power of tissue P systems with insertion and deletion rules. Pre-Proceedings of Workshop on Membrane Computing. Report RGML, vol. 28, pp. 304\u2013318. Univ. Tarragona, Spain (2003)"},{"issue":"16","key":"9_CR15","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1016\/j.dam.2007.05.021","volume":"155","author":"M Kutrib","year":"2007","unstructured":"Kutrib, M., Malcher, A.: Finite turns and the regular closure of linear context-free languages. Discrete Appl. Math. 155(16), 2152\u20132164 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9_CR16","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, G., Rogozhin, Y., Verlan, S.: Context-free insertion-deletion systems. Theoret. Comput. Sci. 330(2), 339\u2013348 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_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. Theoret. Comput. Sci. 456, 80\u201388 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)"},{"issue":"4","key":"9_CR19","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":"9_CR20","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"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41114-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:02:41Z","timestamp":1594598561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41114-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411132","9783319411149"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41114-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}