Hairpin Lengthening and Shortening of Regular Languages

Manea, Florin, Mercas, Robert and Mitrana, Victor (2012) Hairpin Lengthening and Shortening of Regular Languages Lecture Notes in Computer Science, 7300 . pp. 145-159. DOI 10.1007/978-3-642-31644-9_10.

This is the latest version of this item.


Download (291Kb) | Preview

Supplementary data:


We consider here two formal operations on words inspired by the DNA biochemistry: hairpin lengthening introduced in [Manea et al. 2010] and its inverse called hairpin shortening. We study the closure of the class of regular languages under the non-iterated and iterated variants of the two operations. The main results are: although any finite number of applications of the hairpin lengthening to a regular language may lead to non-regular languages, the iterated hairpin lengthening of a regular language is always regular. As far as the hairpin shortening operation is concerned, the class of regular languages is closed under bounded and unbounded iterated hairpin shortening.

Document Type: Article
Keywords: Formal languages, Regular languages, Hairpin completion, Hairpin lengthening, Algorithms.
Research affiliation: Kiel University
Refereed: Yes
DOI etc.: 10.1007/978-3-642-31644-9_10
ISSN: 0302-9743
Date Deposited: 16 Apr 2013 14:31
Last Modified: 15 Mar 2018 04:48

Available Versions of this Item

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...