| Bibliography | Diekert, Volker; Kopecki, Steffen: Complexity Results and the Growths of Hairpin Completions of Regular Languages.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Technical Report Computer Science No. 2010/04.
16 pages, english.
|
|---|
| CR-Schema | F.4.3 (Formal Languages)
|
|---|
| Keywords | Automata and Formal Languages; Finite Automata; DNA-Computing; Hairpin Completion |
|---|
| Abstract | 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 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(n^8), this improves our previous results, which provided O(n^{20}).
3.) For the one-sided case (which is closer to DNA computing) the time is O(n^2), only.
4.) The hairpin completion of a regular language 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.
|
|---|
Full text and
other links | PDF (413087 Bytes)
|
|---|
| Contact | steffen.kopecki@fmi.uni-stuttgart.de |
|---|
| Department(s) | University of Stuttgart, Institute of Formal Methods in Computer Science, Theoretical Computer Science
|
|---|
| Entry date | June 28, 2010 |
|---|