{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T06:13:57Z","timestamp":1784528037005,"version":"3.55.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319946306","type":"print"},{"value":"9783319946313","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94631-3_5","type":"book-chapter","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T06:09:52Z","timestamp":1531202992000},"page":"49-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Site-Directed Insertion: Decision Problems, Maximality and Minimality"],"prefix":"10.1007","author":[{"given":"Da-Jung","family":"Cho","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taylor J.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"JC Birget","year":"1992","unstructured":"Birget, J.C.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43, 185\u2013190 (1992)","journal-title":"Inf. Process. Lett."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2017.03.040","volume":"701","author":"D-J Cho","year":"2017","unstructured":"Cho, D.-J., Han, Y.-S., Ng, T., Salomaa, K.: Outfix-guided insertion. Theor. Comput. Sci. 701, 70\u201384 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2006.12.004","volume":"374","author":"E Csuhaj-Varju","year":"2007","unstructured":"Csuhaj-Varju, E., Petre, I., Vaszil, G.: Self-assembly of string and languages. Theor. Comput. Sci. 374, 74\u201381 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Daley, M., Kari, L., Gloor, G., Siromoney, R.: Circular contextual insertions\/deletions with applications to biomolecular computation. In: String Processing and Information Retrieval Symposium, pp. 47\u201354 (1999)","DOI":"10.1109\/SPIRE.1999.796577"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-30550-7_14","volume-title":"Developments in Language Theory","author":"M Domaratzki","year":"2004","unstructured":"Domaratzki, M.: Semantic shuffle on and deletion along trajectories. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 163\u2013174. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30550-7_14"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00236-004-0140-4","volume":"40","author":"M Domaratzki","year":"2004","unstructured":"Domaratzki, M.: Trajectory-based codes. Acta Inf. 40, 491\u2013527 (2004)","journal-title":"Acta Inf."},{"key":"5_CR7","first-page":"81","volume":"73","author":"M Domaratzki","year":"2006","unstructured":"Domaratzki, M., Rozenberg, G., Salomaa, K.: Interpreted trajectories. Fundamenta Informaticae 73, 81\u201397 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.3233\/FI-2015-1206","volume":"138","author":"S Enaganti","year":"2015","unstructured":"Enaganti, S., Kari, L., Kopecki, S.: A formal language model of DNA polymerase enzymatic activity. Fundamenta Informaticae 138, 179\u2013192 (2015)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s11047-015-9538-x","volume":"16","author":"S Enaganti","year":"2017","unstructured":"Enaganti, S., Ibarra, O., Kari, L., Kopecki, S.: On the overlap assembly of strings and languages. Nat. Comput. 16, 175\u2013185 (2017)","journal-title":"Nat. Comput."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s11047-010-9199-8","volume":"10","author":"G Franco","year":"2011","unstructured":"Franco, G., Manca, V.: Algorithmic applications of XPCR. Nat. Comput. 10, 805\u2013811 (2011)","journal-title":"Nat. Comput."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1142\/S0129054116500349","volume":"27","author":"Y-S Han","year":"2016","unstructured":"Han, Y.-S., Ko, S.-K., Ng, T., Salomaa, K.: State complexity of insertion. Int. J. Found. Comput. Sci. 27, 863\u2013878 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2\u20134","key":"5_CR12","first-page":"165","volume":"17","author":"M Holzer","year":"2012","unstructured":"Holzer, M., Jakobi, S.: Descriptional complexity of chop operations on unary and finite languages. J. Autom. Lang. Comb. 17(2\u20134), 165\u2013183 (2012)","journal-title":"J. Autom. Lang. Comb."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2017.02.002","volume":"682","author":"M Holzer","year":"2017","unstructured":"Holzer, M., Jakobi, S., Kutrib, M.: The chop of languages. Theor. Comput. Sci. 682, 122\u2013137 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-59136-5_8","volume-title":"Handbook of Formal Languages, Vol. 1","author":"H J\u00fcrgensen","year":"1997","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Vol. 1, pp. 511\u2013607. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_8"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(94)90230-5","volume":"132","author":"L Kari","year":"1994","unstructured":"Kari, L.: On language equations with invertible operations. Theor. Comput. Sci. 132, 129\u2013150 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR16","doi-asserted-by":"publisher","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, 47\u201361 (1996)","journal-title":"Inf. Comput."},{"key":"5_CR17","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. Theor. Comput. Sci. 197, 1\u201356 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/0734-9750(92)91451-J","volume":"10","author":"J Reikofski","year":"1992","unstructured":"Reikofski, J., Yao, B.Y.: Polymerase chain reaction (PCR) techniques for site-directed mutagenesis. Biotechnol. Adv. 10, 535\u2013547 (1992)","journal-title":"Biotechnol. Adv."},{"key":"5_CR19","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2009","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2009)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94631-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T17:37:35Z","timestamp":1751737055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94631-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946306","9783319946313"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.smu.ca\/~dcfs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}