Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The syntactic monoid of hairpin-free languages
Acta Informatica
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
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On some algorithmic problems regarding the hairpin completion
Discrete Applied Mathematics
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
A series of algorithmic results related to the iterated hairpin completion
Theoretical Computer Science
Complexity results and the growths of hairpin completions of regular languages
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
On iterated hairpin completion
Theoretical Computer Science
Language theoretical properties of hairpin formations
Theoretical Computer Science
Deciding regularity of hairpin completions of regular languages in polynomial time
Information and Computation
Hairpin completion with bounded stem-loop
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |
The hairpin completion is a natural operation of formal languages which has been inspired by molecular phenomena in biology and by DNA-computing. The hairpin completion of a regular language is linear context-free and we consider the problem to decide whether the hairpin completion remains regular. This problem has been open since the first formal definition of the operation. In this paper we present a positive solution to this problem. Our solution yields more than decidability because we present a polynomial time procedure. The degree of the polynomial is however unexpectedly high, since in our approach it is more than n 14. Nevertheless, the polynomial time result is surprising, because even if the hairpin completion $\mathcal{H}$ of a regular language L is regular, there can be an exponential gap between the size of a minimal DFA for L and the size of a smallest NFA for $\mathcal{H}$.