IT IS NL-COMPLETE TO DECIDE WHETHER A HAIRPIN COMPLETION OF REGULAR LANGUAGES IS REGULAR
2011 ◽
Vol 22
(08)
◽
pp. 1813-1828
◽
Keyword(s):
The One
◽
The hairpin completion is an operation on formal languages which is inspired by the hairpin formation in biochemistry. Hairpin formations occur naturally within DNA-computing. It has been known that the hairpin completion of a regular language is linear context-free, but not regular, in general. However, for some time it is was open whether the regularity of the hairpin completion of a regular language is decidable. In 2009 this decidability problem has been solved positively in [5] by providing a polynomial time algorithm. In this paper we improve the complexity bound by showing that the decision problem is actually NL-complete. This complexity bound holds for both, the one-sided and the two-sided hairpin completions.
2013 ◽
Vol 24
(07)
◽
pp. 1067-1082
◽
Keyword(s):
2012 ◽
Vol 23
(01)
◽
pp. 87-98
2006 ◽
Vol 17
(02)
◽
pp. 379-393
◽
2008 ◽
Vol 19
(03)
◽
pp. 717-727
Keyword(s):
2011 ◽
Vol 22
(05)
◽
pp. 1197-1209
◽
2004 ◽
Vol 02
(01)
◽
pp. 173-213
◽
Keyword(s):
1997 ◽
Vol 134
(1)
◽
pp. 59-74
◽
Keyword(s):
Keyword(s):