{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:32:42Z","timestamp":1777645962220,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-4","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2011,6]]},"abstract":"<jats:p>Hairpin completion is an abstract operation modeling a DNA bio-operation which receives as input a DNA strand w = x\u03b1y\\bar{\u03b1}, and outputs w' = x\u03b1y\\bar{\u03b1}\\bar{x}, where \\bar{x} denotes the Watson-Crick complement of x. In this paper, we focus on the problem of finding conditions under which the iterated hairpin completion of a given word is regular. According to the numbers of words \u03b1 and \\bar{\u03b1} that initiate hairpin completion and how they are scattered, we classify the set of all words w. For some basic classes of words w containing small numbers of occurrences of \u03b1 and \\bar{\u03b1}, we prove that the iterated hairpin completion of w is regular. For other classes with higher numbers of occurrences of \u03b1 and \\bar{\u03b1}, we prove a necessary and sufficient condition for the iterated hairpin completion of a word in these classes to be regular.<\/jats:p>","DOI":"10.3233\/fi-2011-538","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:44:50Z","timestamp":1575330290000},"page":"201-215","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Regularity of Iterated Hairpin Completion of a Single Word"],"prefix":"10.1177","volume":"110","author":[{"given":"Lila","family":"Kari","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Western Ontario, London, Ontario, N6A 5B7, Canada. {lila, sseki}@csd.uwo.ca; sseki@pharm.kyoto-u.ac.jp"}]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Western Ontario, London, Ontario, N6A 5B7, Canada. {lila, sseki}@csd.uwo.ca; sseki@pharm.kyoto-u.ac.jp"}]},{"given":"Steffen","family":"Kopecki","sequence":"additional","affiliation":[{"name":"Institute for Formal Methods in Computer Science (FMI), University of Stuttgart, Universit\u00e4tsstra\u00dfe, D-70569, Stuttgart, Germany. kopecki@fmi.uni-stuttgart.de"}]}],"member":"179","published-online":{"date-parts":[[2011,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-538","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:33:54Z","timestamp":1777444434000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2011-538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":0,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.3233\/FI-2011-538"],"URL":"https:\/\/doi.org\/10.3233\/fi-2011-538","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}