Rational series and their languages
Rational series and their languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The syntactic monoid of hairpin-free languages
Acta Informatica
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Reversal-bounded multi-pushdown machines
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science
On the Hairpin Completion of Regular Languages
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
Iterated hairpin completions of non-crossing words
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Deciding regularity of hairpin completions of regular languages in polynomial time
Information and Computation
On the Regularity of Iterated Hairpin Completion of a Single Word
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
| Hi-index | 0.00 |
The hairpin completion is a natural operation on formal languages which has been inspired by molecular phenomena in biology and by DNA-computing. In 2009 we presented in [6] a (polynomial time) decision algorithm to decide regularity of the hairpin completion. In this paper we provide four new results: 1.) We show that the decision problem is NL-complete. 2.) There is a polynomial time decision algorithm which runs in time O(n8), this improves [6], which provided O(n20). 3.) For the one-sided case (which is closer to DNA computing) the time is O(n2), only. 4.) The hairpin completion is unambiguous linear context-free. This result allows to compute the growth (generating function) of the hairpin completion and to compare it with the growth of the underlying regular language.