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
On the Hairpin Completion of Regular Languages
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Memory bounds for recognition of context-free and context-sensitive languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
On the iterated hairpin completion
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Information and Computation
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
Language theoretical properties of hairpin formations
Theoretical Computer Science
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
Hairpin completion with bounded stem-loop
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 5.23 |
(Bounded) hairpin completion and its iterated versions are operations on formal languages which have been inspired by hairpin formation in DNA biochemistry. The paper answers two questions asked in the literature about iterated hairpin completion. The first question is whether the class of regular languages is closed under iterated bounded hairpin completion. Here we show that this is true by providing a more general result which applies to all classes of languages which are closed under finite union, intersection with regular sets, and concatenation with regular sets. In particular, all Chomsky classes and all standard complexity classes are closed under iterated bounded hairpin completion. In the second part of the paper we address the question whether the iterated hairpin completion of a singleton is always regular. In contrast to the first question, this one has a negative answer. We exhibit an example of a singleton language whose iterated hairpin completion is not regular: actually, it is not context-free, but context-sensitive.