{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:48:31Z","timestamp":1725857311830},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319413112"},{"type":"electronic","value":"9783319413129"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-41312-9_4","type":"book-chapter","created":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T01:16:35Z","timestamp":1465866995000},"page":"35-48","source":"Crossref","is-referenced-by-count":5,"title":["Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakshmanan","family":"Kuppusamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indhumathi","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"issue":"1\u20132","key":"4_CR1","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 412(1\u20132), 136\u2013144 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR2","series-title":"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. Molecular Biology. Ellis Horwood, Chichester (1993)"},{"issue":"2","key":"4_CR3","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 387(2), 103\u2013112 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0304-3975(02)00656-4","volume":"296","author":"N Fernau","year":"2003","unstructured":"Fernau, N.: Nonterminal complexity of programmed grammars. Theor. Comput. Sci. 296, 225\u2013251 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1\/2","key":"4_CR5","first-page":"117","volume":"12","author":"H Fernau","year":"2007","unstructured":"Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Automata Lang. Comb. 12(1\/2), 117\u2013138 (2007)","journal-title":"J. Automata Lang. Comb."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Fernau, H., Kuppusamy, L.: Parikh images of matrix ins-del systems. In: Cai, J.-Y., Cui, J., Sun, X. (eds.) TAMC 2016. LNCS. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-319-55911-7_15"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Fernau, H., Kuppusamy, L., Raman, I.: Descriptional complexity of graph-controlled insertion-deletion systems. In: C\u00e2mpeanu, C., Manea, F., Shallit, J.O. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 111\u2013125. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-319-41114-9_9"},{"key":"4_CR8","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, vol. 31. EPTCS, pp. 88\u201398 (2010)","DOI":"10.4204\/EPTCS.31.11"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-45132-3_14","volume-title":"Machines, Computations, and Universality","author":"R Freund","year":"2001","unstructured":"Freund, R., P\u0103un, G.: On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 214\u2013225. Springer, Heidelberg (2001)"},{"key":"4_CR10","unstructured":"Galiukschov, B.S.: Semicontextual grammars (in Russian). Mat. logica i mat. ling., Kalinin Univ., pp. 38\u201350 (1981)"},{"issue":"(5\/6)","key":"4_CR11","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"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-Dimensional vector addition systems. Theor. Comput. Sci. 8, 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-319-23111-2_6","volume-title":"Machines, Computations, and Universality","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.) MCU 2015. LNCS, vol. 9288, pp. 79\u201393. Springer, Heidelberg (2015)"},{"key":"4_CR14","unstructured":"Kari, L.: On insertion and deletion in formal languages. PhD thesis, University of Turku, Finland (1991)"},{"issue":"1","key":"4_CR15","doi-asserted-by":"crossref","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":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kuppusamy, L., Raman, I., Krithivasan, K.: On succinct description of certain context-free languages by ins-del and matrix ins-del systems. Int. J. Found. Comput. Sci. (2016, to appear)","DOI":"10.1142\/S0129054116500295"},{"issue":"4","key":"4_CR18","first-page":"316","volume":"26","author":"M Marcus","year":"1990","unstructured":"Marcus, M., P\u0103un, G.: Regulated Galiukschov semicontextual grammars. Kybernetika 26(4), 316\u2013326 (1990)","journal-title":"Kybernetika"},{"key":"4_CR19","first-page":"1525","volume":"14","author":"S Marcus","year":"1969","unstructured":"Marcus, S.: Contextual grammars. Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es 14, 1525\u20131534 (1969)","journal-title":"Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"issue":"2","key":"4_CR20","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 330(2), 339\u2013348 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"4_CR21","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0304-3975(97)00079-0","volume":"205","author":"C Mart\u00edn-Vide","year":"1998","unstructured":"Mart\u00edn-Vide, C., P\u0103un, G., Salomaa, A.: Characterizations of recursively enumerable languages by means of insertion grammars. Theor. Comput. Sci. 205(1\u20132), 195\u2013205 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BFb0052165","volume-title":"Logical Aspects of Computational Linguistics","author":"J Michaelis","year":"1997","unstructured":"Michaelis, J., Kracht, M.: Semilinearity as a syntactic invariant. In: Retor\u00e9, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 329\u2013345. Springer, Heidelberg (1997)"},{"issue":"4","key":"4_CR23","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"4_CR24","doi-asserted-by":"crossref","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.)"},{"key":"4_CR25","doi-asserted-by":"crossref","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."},{"key":"4_CR26","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"crossref","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. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (1998)"},{"key":"4_CR27","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1207\/s15516709cog2805_4","volume":"28","author":"E Stabler","year":"2004","unstructured":"Stabler, E.: Varieties of crossing dependencies: structure dependence and mild context sensitivity. Cogn. Sci. 28, 699\u2013720 (2004)","journal-title":"Cogn. Sci."},{"issue":"2","key":"4_CR28","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","Unconventional Computation and Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41312-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T18:03:03Z","timestamp":1568052183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41312-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319413112","9783319413129"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41312-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}