Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: It Is NL-complete to Decide Whether a Hairpin Completion of Regular
  Languages Is Regular   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 is decidable. In 2009 this decidability problem has
been solved positively 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.

35
The categories of this paper are: mtrl-th
26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
2
The categories of this paper are: math
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph