3 research outputs found
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
The hairpin completion is an operation on formal languages that has been
inspired by the hairpin formation in DNA biochemistry and by DNA computing. In
this paper we investigate the hairpin completion of regular languages.
It is well known that hairpin completions of regular languages are linear
context-free and not necessarily regular. As regularity of a (linear)
context-free language is not decidable, the question arose whether regularity
of a hairpin completion of regular languages is decidable. We prove that this
problem is decidable and we provide a polynomial time algorithm.
Furthermore, we prove that the hairpin completion of regular languages is an
unambiguous linear context-free language and, as such, it has an effectively
computable growth function. Moreover, we show that the growth of the hairpin
completion is exponential if and only if the growth of the underlying languages
is exponential and, in case the hairpin completion is regular, then the hairpin
completion and the underlying languages have the same growth indicator
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions
The aim of this paper is to design the polynomial construction of a finite
recognizer for hairpin completions of regular languages. This is achieved by
considering completions as new expression operators and by applying derivation
techniques to the associated extended expressions called hairpin expressions.
More precisely, we extend partial derivation of regular expressions to
two-sided partial derivation of hairpin expressions and we show how to deduce a
recognizer for a hairpin expression from its two-sided derived term automaton,
providing an alternative proof of the fact that hairpin completions of regular
languages are linear context-free.Comment: 28 page