{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:52:31Z","timestamp":1725562351573},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207818"},{"type":"electronic","value":"9783540246350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24635-0_15","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:11:15Z","timestamp":1280747475000},"page":"213-218","source":"Crossref","is-referenced-by-count":0,"title":["n-Insertion on Languages"],"prefix":"10.1007","author":[{"given":"Masami","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"Sugiura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-46011-X_15","volume-title":"Developments in Language Theory","author":"C. C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., Salomaa, K., V\u00e1gv\u00f6lgyi, S.: Shuffle quotient and decompositions. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 186\u2013196. Springer, Heidelberg (2002)"},{"key":"15_CR2","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"15_CR3","first-page":"257","volume":"8","author":"M. Ito","year":"2002","unstructured":"Ito, M.: Shuffle decomposition of regular languages. Journal of Universal Computer Science\u00a08, 257\u2013259 (2002)","journal-title":"Journal of Universal Computer Science"},{"key":"15_CR4","unstructured":"Kari, L.: On insertion and deletion in formal languages, PhD thesis, University of Turku (1991)"},{"key":"15_CR5","unstructured":"Kari, L., P\u0103un, G., Thierrin, G., Yu, S.: At the crossroads of DNA computing and formal languages: Characterizing RE using insertion-deletion systems. In: Prof. 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, pp. 318\u2013333 (1997)"},{"key":"15_CR6","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, Berlin (1998)"}],"container-title":["Lecture Notes in Computer Science","Aspects of Molecular Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24635-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T13:15:32Z","timestamp":1552828532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24635-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207818","9783540246350"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24635-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}