{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:01:37Z","timestamp":1742972497457,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_45","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T22:42:00Z","timestamp":1502836920000},"page":"347-356","source":"Crossref","is-referenced-by-count":0,"title":["Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing"],"prefix":"10.1007","author":[{"given":"G.","family":"Samdanielthompson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. Gnanamalar","family":"David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. G.","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"45_CR1","first-page":"61","volume":"4","author":"S Abraham","year":"1965","unstructured":"Abraham, S.: Some questions of phrase structure grammars I. Comput. Linguist. 4, 61\u201370 (1965)","journal-title":"Comput. Linguist."},{"issue":"5187","key":"45_CR2","first-page":"1021","volume":"266","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Sci. New Series 266(5187), 1021\u20131024 (1994)","journal-title":"Sci. New Series"},{"key":"45_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2012.03.008","volume":"436","author":"J Berstel","year":"2012","unstructured":"Berstel, J., Boasson, L., Fagnot, I.: Splicing systems and the Chomsky hierarchy. Theoret. Comput. Sci. 436, 2\u201322 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"45_CR4","unstructured":"Ceterchi, R., Subramanian, K.G.: Grammar systems with context-free rewriting and flat splicing. In: Gheorghe, M., et al. (ed.) Multidisciplinary Creativity, pp. 221\u2013227. Spandugino, Bucuresti (2015)"},{"key":"45_CR5","unstructured":"Csuhaj-Varju, E., Dassow, J., Kelemen, J., P\u0103un, G.: Grammar systems: a grammatical approach to distribution and cooperation. Gordon and Breach Science Publishers (1994)"},{"key":"45_CR6","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-39886-8_13","volume-title":"Formal Languages and Applications","author":"J Dassow","year":"2004","unstructured":"Dassow, J.: Grammars with regulated rewriting. In: Martin-Vide, C., et al. (eds.) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol. 148, pp. 249\u2013273. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-39886-8_13"},{"key":"45_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)"},{"key":"45_CR8","first-page":"109","volume":"15","author":"J Dassow","year":"1996","unstructured":"Dassow, J., Mitrana, V.: Splicing grammar systems. Comput. Artif. Intell. 15, 109\u2013122 (1996)","journal-title":"Comput. Artif. Intell."},{"key":"45_CR9","series-title":"Studies in Computatioinal Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-33461-3","volume-title":"Recent Advances in Formal Languages and Applications","author":"Z Esik","year":"2006","unstructured":"Esik, Z., Martin-Vide, C., Mitrana, V.: Recent Advances in Formal Languages and Applications. Studies in Computatioinal Intelligence. Springer, Heidelberg (2006)"},{"issue":"2","key":"45_CR10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.5121\/ijcga.2014.4202","volume":"4","author":"K Fating","year":"2014","unstructured":"Fating, K., Ghotkar, A.: Performance analysis of chaincode descriptor for handshape classification. Int. J. Comp. Graphics Animation. 4(2), 9\u201319 (2014)","journal-title":"Int. J. Comp. Graphics Animation."},{"issue":"1","key":"45_CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s002240000112","volume":"32","author":"R Freund","year":"1999","unstructured":"Freund, R., Kari, L., P\u0103un, G.: DNA computing based on splicing: the existence of universal computers. Theory Comput. Syst. 32(1), 69\u2013112 (1999)","journal-title":"Theory Comput. Syst."},{"key":"45_CR12","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/BF02481771","volume":"49","author":"T Head","year":"1987","unstructured":"Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biol. 49, 735\u2013759 (1987)","journal-title":"Bull. Math. Biol."},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Head, T.: Circular suggestions for DNA Computing. In: Carbone, A., et al. (ed.) Pattern Formation in Biology, Vision and Dynamics, pp. 325\u2013335. World Scientific (2000)","DOI":"10.1142\/9789812817723_0016"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-662-07675-0_7","volume-title":"Handbook of Formal Languages","author":"T Head","year":"1997","unstructured":"Head, T., P\u0103un, G., Pixton, D.: Language theory and molecular genetics: generative mechanisms suggested by DNA recombination. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 295\u2013358. Springer, Heidelberg (1997). doi:\n10.1007\/978-3-662-07675-0_7"},{"key":"45_CR15","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0019-9958(70)80034-1","volume":"17","author":"OH Ibarra","year":"1970","unstructured":"Ibarra, O.H.: Simple matrix languages. Inform. Control. 17, 359\u2013394 (1970)","journal-title":"Inform. Control."},{"key":"45_CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(87)90107-1","volume":"52","author":"C Kim","year":"1987","unstructured":"Kim, C., Sudborough, I.H.: The membership and the equivalence problem for picture languages. Theor. Comput. Sci. 52, 177\u2013191 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-39886-8","volume-title":"Formal Languages and Applications","author":"C Martin-Vide","year":"2004","unstructured":"Martin-Vide, C., Mitrana, V., P\u0103un, G.: Formal Languages and Applications. Springer, Heidelberg (2004)"},{"key":"45_CR18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0019-9958(82)80020-X","volume":"54","author":"HA Maurer","year":"1982","unstructured":"Maurer, H.A., Rozenberg, G., Welzl, E.: Using string languages to describe picture languages. Inf. Contro. 54, 155\u2013185 (1982)","journal-title":"Inf. Contro."},{"issue":"2","key":"45_CR19","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0304-3975(99)00104-8","volume":"231","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un, G.: DNA computing based on splicing: universality results. Theor. Comput. Sci. 231(2), 275\u2013296 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR20","series-title":"Texts in Theoretical Computer Science. An EATCS Series","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":"45_CR21","volume-title":"Handbook of Formal Languages","author":"G Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Heidelberg (1997)"},{"key":"45_CR22","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0019-9958(69)90050-3","volume":"14","author":"R Siromoney","year":"1969","unstructured":"Siromoney, R.: On equal matrix languages. Inf. Control 14, 135\u2013151 (1969)","journal-title":"Inf. Control"},{"issue":"1","key":"45_CR23","first-page":"15","volume":"1","author":"RS Vaddi","year":"2011","unstructured":"Vaddi, R.S., Boggavarapu, L.N.P., Vankayalapati, H.D., Anne, K.R.: Contour detection using Freeman chaincode and approximation methods for the real time object detection. Asian J. Comp. Sci. Inform. Tech. 1(1), 15\u201317 (2011)","journal-title":"Asian J. Comp. Sci. Inform. Tech."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T22:53:59Z","timestamp":1508885639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}