{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:30Z","timestamp":1759637910795},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009815"},{"type":"electronic","value":"9783642009822"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00982-2_55","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T19:51:54Z","timestamp":1238442714000},"page":"648-659","source":"Crossref","is-referenced-by-count":2,"title":["New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Onodera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"55_CR1","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. Theor. Comput. Sci.\u00a0330(2), 339\u2013348 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"55_CR2","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":"10","key":"55_CR3","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/34.722617","volume":"20","author":"T. Yokomori","year":"1998","unstructured":"Yokomori, T., Kobayashi, S.: Learning local languages and their application to DNA sequence analysis. IEEE Trans. Pattern Anal. Mach. Intell.\u00a020(10), 1067\u20131079 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"55_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0166-218X(98)00053-5","volume":"87","author":"T. Head","year":"1998","unstructured":"Head, T.: Splicing representations of strictly locally testable languages. Discrete Applied Math.\u00a087, 87\u2013139 (1998)","journal-title":"Discrete Applied Math."},{"issue":"1-2","key":"55_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0304-3975(97)00079-0","volume":"205","author":"C. Martin-Vide","year":"1998","unstructured":"Martin-Vide, C., P\u0103un, G., Salomaa, A.: Characterizations of recursively enumerable languages by means of insertion grammars. Theor. Comput. Sci.\u00a0205(1-2), 195\u2013205 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"55_CR6","first-page":"1424","volume":"44","author":"K. Onodera","year":"2003","unstructured":"Onodera, K.: A note on homomorphic representation of recursively enumerable languages with insertion grammars. IPSJ Journal\u00a044(5), 1424\u20131427 (2003)","journal-title":"IPSJ Journal"},{"issue":"4","key":"55_CR7","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1142\/S0129054108006005","volume":"19","author":"G. P\u0103un","year":"2008","unstructured":"P\u0103un, G., P\u00e9rez-Jim\u00e9nez, M.J., Yokomori, T.: Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems. Int. J. Found. Comput. Sci.\u00a019(4), 859\u2013871 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"volume-title":"Handbook of formal languages","year":"1997","key":"55_CR8","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of formal languages. Springer, New York (1997)"},{"key":"55_CR9","series-title":"M.I.T. research monograph","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.A.: Counter-Free Automata. M.I.T. research monograph, vol.\u00a065. MIT Press, Cambridge (1971)"},{"issue":"1","key":"55_CR10","first-page":"317","volume":"12","author":"S. Verlan","year":"2007","unstructured":"Verlan, S.: On minimal context-free insertion-deletion systems. J. Autom. Lang. Comb.\u00a012(1), 317\u2013328 (2007)","journal-title":"J. Autom. Lang. Comb."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T07:17:25Z","timestamp":1551943045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}