{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:40Z","timestamp":1725536320648},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"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-03564-7_13","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T07:05:35Z","timestamp":1250751935000},"page":"204-219","source":"Crossref","is-referenced-by-count":0,"title":["On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes"],"prefix":"10.1007","author":[{"given":"Bo","family":"Cui","sequence":"first","affiliation":[]},{"given":"Lila","family":"Kari","sequence":"additional","affiliation":[]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Academic Press. Inc., Orlando (1985)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2004.02.031","volume":"320","author":"M. Domaratzki","year":"2004","unstructured":"Domaratzki, M.: Deletion along trajectories. Theoretical Computer Science\u00a0320, 293\u2013313 (2004)","journal-title":"Theoretical Computer Science"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(96)00307-6","volume":"183","author":"M. Ito","year":"1997","unstructured":"Ito, M., Kari, L., Thierrin, G.: Insertion and deletion closure of languages. Theoretical Computer Science\u00a0183, 3\u201319 (1997)","journal-title":"Theoretical Computer Science"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-57163-9_4","volume-title":"Fundamentals of Computation Theory","author":"H. J\u00fcrgensen","year":"1993","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: The hierarchy of codes. In: \u00c9sik, Z. (ed.) FCT 1993. LNCS, vol.\u00a0710, pp. 50\u201368. Springer, Heidelberg (1993)"},{"key":"13_CR5","unstructured":"Kari, L.: On Insertion and Deletion in Formal Languages. Ph.D. Thesis, University of Turku (1991)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-55808-X_30","volume-title":"Mathematical Foundations of Computer Science 1992","author":"L. Kari","year":"1992","unstructured":"Kari, L.: Insertion and deletion of words: determinism and reversibility. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol.\u00a0629, pp. 315\u2013326. Springer, Heidelberg (1992)"},{"key":"13_CR7","first-page":"49","volume":"53","author":"L. Kari","year":"1998","unstructured":"Kari, L., Thierrin, G.: Words insertions and primitivity. Utilitas Mathematica\u00a053, 49\u201361 (1998)","journal-title":"Utilitas Mathematica"},{"issue":"1","key":"13_CR8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.3233\/FI-1993-193-407","volume":"18","author":"L. Kari","year":"1993","unstructured":"Kari, L., Mateescu, A., Paun, G., Salomaa, A.: Deletion sets. Fundamenta Informatica\u00a018(1), 355\u2013370 (1993)","journal-title":"Fundamenta Informatica"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1051\/ita\/1995290201291","volume":"29","author":"L. Kari","year":"1995","unstructured":"Kari, L., Mateescu, A., Paun, G., Salomaa, A.: On parallel deletions applied to a word. RAIRO. Theoret. Inform. Appl.\u00a029, 129\u2013144 (1995)","journal-title":"RAIRO. Theoret. Inform. Appl."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0304-3975(97)00284-3","volume":"180","author":"M. Kudlek","year":"1997","unstructured":"Kudlek, M., Mateescu, A.: On distributed catenation. Theoretical Computer Science\u00a0180, 341\u2013352 (1997)","journal-title":"Theoretical Computer Science"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-62844-4_31","volume-title":"New Trends in Formal Languages","author":"M. Kudlek","year":"1997","unstructured":"Kudlek, M., Mateescu, A.: On mix operation. New Trends in Formal Languages. In: P\u0103un, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol.\u00a01218, pp. 35\u201344. Springer, Heidelberg (1997)"},{"key":"13_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.tcs.2008.09.049","volume":"410","author":"F. Manea","year":"2009","unstructured":"Manea, F., Mitrana, V., Yokomori, T.: Two complementary operations inspired by the DNA hairpin formation: Completion and reduction. Theoretical Computer Science\u00a0410, 417\u2013425 (2009)","journal-title":"Theoretical Computer Science"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00163-1","volume":"197","author":"A. Mateescu","year":"1998","unstructured":"Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: syntactic constraints. Theoretical Computer Science\u00a0197, 1\u201356 (1998)","journal-title":"Theoretical Computer Science"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. Journal of the Association for Computing Machinery\u00a013, 570\u2013581 (1966)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR16","unstructured":"Shyr, H.J.: Free Monoids and Languages. Lecture Notes, Institute of Applied Mathematics, National Chung-Hsing University, Taichung, Taiwan (2001)"},{"key":"13_CR17","unstructured":"Yu, S.S.: Languages and Codes. Lecture Notes, Department of Computer Science, National Chung-Hsing University, Taichung, Taiwan 402 (2005)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1080\/00207169008803909","volume":"36","author":"S.S. Yu","year":"1990","unstructured":"Yu, S.S.: A characterization of intercodes. Intern. J. Computer Math.\u00a036, 39\u201348 (1990)","journal-title":"Intern. J. Computer Math."}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T21:17:18Z","timestamp":1633814238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}