On the Iterated Hairpin Completion

13 years 4 months ago

Download elib.uni-stuttgart.de

The hairpin completion is a natural operation on formal languages which has been inspired by biochemistry and DNA-computing. In this paper we solve two problems which were posed first in 2008 and 2009, respectively, and still left open:

Steffen Kopecki

Real-time Traffic

CORR 2010 | Education | Formal Languages | Hairpin Completion | Natural Operation |

claim paper

» On the regularity of iterated hairpin completion of a single word

» Bounded Hairpin Completion

» Measuring Ranks via the Complete Laws of Iterated Contraction

» TPR Packing Analysis and 3D Modeling for the HAT Domain of Human Crooked Neck Protein

» The syntactic monoid of hairpinfree languages

» Complete Axioms for Categorical FixedPoint Operators

» A Sound and Complete Calculus for Finite Stream Circuits

» Complete Iterativity for Algebras with Effects

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Steffen Kopecki

Comments (0)

Sciweavers

On the Iterated Hairpin Completion

CORR 2010 | Education | Formal Languages | Hairpin Completion | Natural Operation |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers