{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:25:04Z","timestamp":1742948704379,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030193102"},{"type":"electronic","value":"9783030193119"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19311-9_5","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"37-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Further Properties of Self-assembly by Hairpin Formation"],"prefix":"10.1007","author":[{"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihaela","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,26]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-10843-2_26","volume-title":"Automata, Languages and Programming","author":"M Blattner","year":"1981","unstructured":"Blattner, M., Latteux, M.: Parikh-bounded languages. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 316\u2013323. Springer, Heidelberg (1981). \n                    https:\/\/doi.org\/10.1007\/3-540-10843-2_26"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s00224-004-1175-1","volume":"39","author":"P Bottoni","year":"2006","unstructured":"Bottoni, P., Labella, A., Manca, V., Mitrana, V.: Superposition based on Watson-Crick-like complementarity. Theory Comput. Syst. 39, 503\u2013524 (2006)","journal-title":"Theory Comput. Syst."},{"key":"5_CR3","first-page":"47","volume-title":"Some Remarks on Hairpin and Loop Languages, Words, Semigroups, and Translations","author":"J Castellanos","year":"2001","unstructured":"Castellanos, J., Mitrana, V.: Some Remarks on Hairpin and Loop Languages, Words, Semigroups, and Translations, pp. 47\u201359. World Scientific, Singapore (2001)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s11047-013-9393-6","volume":"13","author":"H-L Chen","year":"2014","unstructured":"Chen, H.-L., Doty, D., Soloveichik, D.: Deterministic function computation with chemical reaction networks. Nat. Comput. 13, 517\u2013534 (2014)","journal-title":"Nat. Comput."},{"key":"5_CR5","unstructured":"Cheptea, D., Martin-Vide, C., Mitrana, V.: A new operation on words suggested by DNA biochemistry: hairpin completion. In: Proceedings of Transgressive Computing, pp. 216\u2013228 (2006)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2006.12.004","volume":"374","author":"E Csuhaj-Varj\u00fa","year":"2007","unstructured":"Csuhaj-Varj\u00fa, E., Petre, I., Vaszil, G.: Self-assembly of strings and languages. Theor. Comput. Sci. 374, 74\u201381 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Deaton, R., Murphy, R., Garzon, M., Franceschetti, D.R., Stevens, S.E.: Good encodings for DNA-based solutions to combinatorial problems. In: Proceedings of DNA-Based Computers II, DIMACS Series, vol. 44, pp. 247\u2013258 (1998)","DOI":"10.1090\/dimacs\/044\/20"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s11047-015-9538-x","volume":"16","author":"SK Enaganti","year":"2017","unstructured":"Enaganti, S.K., Ibarra, O.H., Kari, L., Kopecki, S.: On the overlap assembly of strings and languages. Nat. Comput. 16, 175\u2013185 (2017)","journal-title":"Nat. Comput."},{"key":"5_CR9","unstructured":"Garzon, M., Deaton, R., Neathery, P., Murphy, R.C., Franceschetti, D.R., Stevens, E.: On the encoding problem for DNA computing. In: Proceedings of Third DIMACS Workshop on DNA-Based Computing, University of Pennsylvania, pp. 230\u2013237 (1997)"},{"key":"5_CR10","unstructured":"Garzon, M., Deaton, R., Nino, L.F., Stevens Jr., S.E., Wittner, M.: Genome encoding for DNA computing. In: Proceedings of Third Genetic Programming Conference, Madison, MI, 1998, pp. 684\u2013690 (1998)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(71)80024-7","volume":"5","author":"S Ginsburg","year":"1971","unstructured":"Ginsburg, S.: AFL with the semilinear property. J. Comput. Syst. Sci. 5, 365\u2013396 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H., Henry, E.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16, 285\u2013296 (1966)","journal-title":"Pac. J. Math."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(77)90103-0","volume":"19","author":"J Goldstine","year":"1977","unstructured":"Goldstine, J.: A simplified proof of Parikh\u2019s theorem. Discrete Math. 19, 235\u2013239 (1977)","journal-title":"Discrete Math."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ic.2010.11.014","volume":"209","author":"M Ito","year":"2011","unstructured":"Ito, M., Leupold, P., Manea, F., Mitrana, V.: Bounded hairpin completion. Inf. Comput. 209, 471\u2013485 (2011)","journal-title":"Inf. Comput."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11505877_26","volume-title":"Developments in Language Theory","author":"L Kari","year":"2005","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P., Thierrin, G.: On hairpin-free words and languages. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 296\u2013307. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/11505877_26"},{"key":"5_CR16","unstructured":"Kopczy\u0144ski, E., To, A.W. : Parikh images of grammars: complexity and applications. In: Proceedings of 25th Annual IEEE Symposium on Logic in Computer Science (LICS), 2010, pp. 80\u201389 (2010)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"3629","DOI":"10.1016\/j.tcs.2011.03.009","volume":"412","author":"S Kopecki","year":"2011","unstructured":"Kopecki, S.: On the iterated hairpin completion. Theor. Comput. Sci. 412, 3629\u20133638 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1016\/j.dam.2007.09.022","volume":"157","author":"F Manea","year":"2009","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V.: On some algorithmic problems regarding the hairpin completion. Discrete Appl. Math. 157, 2143\u20132152 (2009)","journal-title":"Discrete Appl. Math."},{"key":"5_CR19","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. Theor. Comput. Sci. 410, 417\u2013425 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-02737-6_30","volume-title":"Developments in Language Theory","author":"F Manea","year":"2009","unstructured":"Manea, F., Mitrana, V., Sempere, J.M.: Some remarks on superposition based on Watson-Crick-like complementarity. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 372\u2013383. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-02737-6_30"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-31644-9_10","volume-title":"Languages Alive","author":"F Manea","year":"2012","unstructured":"Manea, F., Mercas, R., Mitrana, V.: Hairpin lengthening and shortening of regular languages. In: Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive. LNCS, vol. 7300, pp. 145\u2013159. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-31644-9_10"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1093\/logcom\/exs076","volume":"25","author":"F Manea","year":"2015","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V.: Hairpin lengthening: language theoretic and algorithmic results. J. Log. Comput. 25, 987\u20131009 (2015)","journal-title":"J. Log. Comput."},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(78)90021-1","volume":"16","author":"D Oppen","year":"1978","unstructured":"Oppen, D.: A \n                    \n                      \n                    \n                    $$2^{2^{2^{pn}}}$$\n                   upper bound on the complexity of Presburger arithmetic. J. Comput. Syst. Sci. 16, 323\u2013332 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM 13, 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1142\/S0129054101000904","volume":"12","author":"G P\u0103un","year":"2001","unstructured":"P\u0103un, G., Rozenberg, G., Yokomori, T.: Hairpin languages. Intern. J. Found. Comp. Sci. 12, 837\u2013847 (2001)","journal-title":"Intern. J. Found. Comp. Sci."},{"key":"5_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0160-6","volume-title":"Numerical Semigroups","author":"JC Rosales","year":"2009","unstructured":"Rosales, J.C., Garc\u00eda-S\u00e1nchez, P.A.: Numerical Semigroups. Springer-Verlag, New-York (2009). \n                    https:\/\/doi.org\/10.1007\/978-1-4419-0160-6"},{"key":"5_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5","volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer-Verlag, Berlin (1997). \n                    https:\/\/doi.org\/10.1007\/978-3-642-59136-5"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1126\/science.288.5469.1223","volume":"288","author":"K Sakamoto","year":"2000","unstructured":"Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular computation by DNA hairpin formation. Science 288, 1223\u20131226 (2000)","journal-title":"Science"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1142\/S0129054116400153","volume":"27","author":"K Shikishima-Tsuji","year":"2016","unstructured":"Shikishima-Tsuji, K.: Regularity of iterative hairpin completions of crossing \n                    \n                      \n                    \n                    $$(2,2)$$\n                  -words. Int. J. Found. Comput. Sci. 27, 375\u2013390 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Winfree, E., Yang, X., Seeman, N.C.: Universal computation via self-assembly of DNA: some theory and experiments. In: DNA Bsed Computers II, vol. 44 of DIMACS (1999), pp. 191\u2013213 (1999)","DOI":"10.1090\/dimacs\/044\/16"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19311-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T03:19:07Z","timestamp":1570763947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19311-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030193102","9783030193119"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19311-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ucnc2019.uec.ac.jp\/index.html","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":"32","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":"19","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":"0","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":"59% - 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.2","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":"4","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)"}},{"value":"4 abstracts of invited talks and one full paper of an invited talk are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}