{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:34:43Z","timestamp":1649201683003},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2016,2]]},"abstract":"<jats:p> Hairpin completion is a formal operation inspired from DNA biochemistry. It is known that the (one step) hairpin completion of a regular language is linear context-free, but not regular in general. Further, it is decidable whether the (one step) hairpin completion of a regular language is regular. However, it is an open question whether the iterated hairpin completion of a regular language is regular, even if it is a singleton. If the word is a non-crossing \u03b1-word, there are results, but for crossing words there are no results. In this paper, we give necessary and sufficient conditions that the iterated hairpin completion of a given crossing (2, 2)-\u03b1-word in [Formula: see text] is regular. <\/jats:p>","DOI":"10.1142\/s0129054116400153","type":"journal-article","created":{"date-parts":[[2016,6,8]],"date-time":"2016-06-08T04:10:40Z","timestamp":1465359040000},"page":"375-389","source":"Crossref","is-referenced-by-count":3,"title":["Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words"],"prefix":"10.1142","volume":"27","author":[{"given":"Kayoko","family":"Shikishima-Tsuji","sequence":"first","affiliation":[{"name":"Center for Liberal Arts Education and Research, Tenri University, 1050 Somanouchi, Tenri, Nara 632-8510, Japan"}]}],"member":"219","published-online":{"date-parts":[[2016,6,7]]},"reference":[{"key":"p_2","first-page":"170","volume":"200","author":"Diekert S.","journal-title":"Springer"},{"key":"p_4","first-page":"471","volume":"209","author":"Ito P.","year":"2011","journal-title":"Computation"},{"key":"p_5","first-page":"337","volume":"201","author":"Kari S.","journal-title":"Springer"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.009"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.09.022"},{"key":"p_9","first-page":"296","volume":"201","author":"Manea C.","journal-title":"Springer"},{"key":"p_10","first-page":"532","volume":"200","author":"Manea V.","journal-title":"Springer"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.049"},{"key":"p_12","first-page":"859","volume":"21","author":"Manea V.","year":"2010","journal-title":"Computer Science"},{"key":"p_13","first-page":"837","volume":"12","author":"Pun G.","year":"2001","journal-title":"Computer Science"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054116400153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:56:16Z","timestamp":1565096176000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054116400153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":10,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2016,6,7]]},"published-print":{"date-parts":[[2016,2]]}},"alternative-id":["10.1142\/S0129054116400153"],"URL":"https:\/\/doi.org\/10.1142\/s0129054116400153","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2]]}}}