1. Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words.
- Author
-
Shikishima-Tsuji, Kayoko
- Subjects
ITERATIVE methods (Mathematics) ,BIOCHEMISTRY ,DNA ,PROGRAMMING languages ,COMPUTER science ,COMPUTER network resources - Abstract
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 α-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)-α-word in is regular. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF