Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Varieties Of Formal Languages
The many facets of natural computing
Communications of the ACM
Hairpin Completion Versus Hairpin Reduction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science
On some algorithmic problems regarding the hairpin completion
Discrete Applied Mathematics
On the Hairpin Completion of Regular Languages
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
A series of algorithmic results related to the iterated hairpin completion
Theoretical Computer Science
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On iterated hairpin completion
Theoretical Computer Science
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Deciding regularity of hairpin completions of regular languages in polynomial time
Information and Computation
| Hi-index | 5.23 |
Hairpin formations arise in biochemical processes and play an important role in DNA-computing. We study language theoretical properties of hairpin formations and our new results concern the hairpin completion H"@k(L"1,L"2) of two regular languages L"1 and L"2 and the iterated hairpin lengthening HL"@k^*(L) of any language L. Assume that L"1 and L"2 belong to a certain variety of regular languages which satisfies a mild closure property (being closed by a restricted concatenation), then either H"@k(L"1,L"2) is not regular or it belongs to the same variety as L"1 and L"2. This result applies, in particular, to the class of first-order definable languages (which is the class of aperiodic or star-free languages) and it applies to the class of first-order definable languages in two variables with predicates