We consider here two formal operations on words inspired by the DNA biochemistry: hairpin lengthening introduced in [15] 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. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Manea, F., Mercas, R., & Mitrana, V. (2012). Hairpin lengthening and shortening of regular languages. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7300 LNAI, 145–159. https://doi.org/10.1007/978-3-642-31644-9_10
Mendeley helps you to discover research relevant for your work.