{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:25:54Z","timestamp":1742919954220,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031074684"},{"type":"electronic","value":"9783031074691"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07469-1_15","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T14:20:31Z","timestamp":1653661231000},"page":"189-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nondeterministic State Complexity of\u00a0Site-Directed Deletion"],"prefix":"10.1007","author":[{"given":"Oliver A. S.","family":"Lyon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"issue":"5187","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L Adleman","year":"1994","unstructured":"Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021\u20131024 (1994)","journal-title":"Science"},{"issue":"4","key":"15_CR2","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(4), 185\u2013190 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1042\/bj2370001","volume":"237","author":"P Carter","year":"1986","unstructured":"Carter, P.: Site-directed mutagenesis. Biochem. J. 237(1), 1\u20137 (1986)","journal-title":"Biochem. J."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-98654-8_18","volume-title":"Developments in Language Theory","author":"D-J Cho","year":"2018","unstructured":"Cho, D.-J., Han, Y.-S., Kim, H., Salomaa, K.: Site-directed deletion. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 219\u2013230. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_18"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2017.03.040","volume":"701","author":"DJ Cho","year":"2017","unstructured":"Cho, D.J., Han, Y.S., Ng, T., Salomaa, K.: Outfix-guided insertion. Theoret. Comput. Sci. 701, 70\u201384 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2019.04.019","volume":"798","author":"DJ Cho","year":"2019","unstructured":"Cho, D.J., Han, Y.S., Salomaa, K., Smith, T.: Site-directed insertion: language equations and decision problems. Theoret. Comput. Sci. 798, 40\u201351 (2019)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"15_CR7","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. Theoret. Comput. Sci. 320(2), 293\u2013313 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"15_CR8","first-page":"15","volume":"10","author":"G Franco","year":"2011","unstructured":"Franco, G., Manca, V.: Algorithmic applications of XPCR. Nat. Comput. Int. J. 10(2), 15 (2011)","journal-title":"Nat. Comput. Int. J."},{"issue":"07","key":"15_CR9","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1142\/S0129054116500349","volume":"27","author":"YS Han","year":"2016","unstructured":"Han, Y.S., Ko, S.K., Ng, T., Salomaa, K.: State complexity of insertion. Int. J. Found. Comput. Sci. 27(07), 863\u2013878 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00236-015-0245-y","volume":"53","author":"Y-S Han","year":"2015","unstructured":"Han, Y.-S., Ko, S.-K., Salomaa, K.: State complexity of deletion and bipolar deletion. Acta Informatica 53(1), 67\u201385 (2015). https:\/\/doi.org\/10.1007\/s00236-015-0245-y","journal-title":"Acta Informatica"},{"key":"15_CR11","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Boston (1979)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Ito, M., Kari, L., Thierrin, G.: Insertion and deletion closure of languages. Theoret. Comput. Sci. 183(1), 3\u201319 (1997)","DOI":"10.1016\/S0304-3975(96)00307-6"},{"key":"15_CR13","unstructured":"Kari, L.: On Insertion and Deletion in Formal Languages. Ph.D. thesis, University of Turku (1991)"},{"issue":"1","key":"15_CR14","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(1), 47\u201361 (1996)","journal-title":"Inf. Comput."},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.mbs.2007.08.010","volume":"211","author":"V Manca","year":"2008","unstructured":"Manca, V., Franco, G.: Computing by polymerase chain reaction. Math. Biosci. 211(2), 282\u2013298 (2008)","journal-title":"Math. Biosci."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1101\/sqb.1986.051.01.032","volume":"51","author":"K Mullis","year":"1986","unstructured":"Mullis, K., Faloona, F., Scharf, S., Saiki, R., Horn, G., Erlich, H.: Specific enzymatic amplification of DNA in vitro: the polymerase chain reaction. Cold Spring Harb. Symp. Quant. Biol. 51, 263\u2013273 (1986). https:\/\/doi.org\/10.1101\/sqb.1986.051.01.032","journal-title":"Cold Spring Harb. Symp. Quant. Biol."},{"key":"15_CR17","unstructured":"Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series). Springer, Berlin (2006)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-36440-4_24","volume-title":"DNA Computing","author":"A Takahara","year":"2003","unstructured":"Takahara, A., Yokomori, T.: On the computational power of insertion-deletion systems. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 269\u2013280. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36440-4_24"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07469-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T23:06:42Z","timestamp":1655766402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07469-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031074684","9783031074691"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07469-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}