Handbook of Formal Languages
Superposition Based on Watson–Crick-Like Complementarity
Theory of Computing Systems
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
On hairpin-free words and languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the Hairpin Completion of Regular Languages
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
A series of algorithmic results related to the iterated hairpin completion
Theoretical Computer Science
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Information and Computation
On iterated hairpin completion
Theoretical Computer Science
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
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 | 0.00 |
We define the hairpin reduction as the inverse operation of a formal operation on words and languages suggested by DNA biochemistry, namely the hairpin completion, introduced in [3]. We settle the closure properties of some classes in the Chomsky hierarchy as well as some complexity classes under the non-iterated version of the hairpin reduction, in comparison with the hairpin completion. Then an algorithm that decides whether or not a regular language coincides with its primitive hairpin root is presented. Finally, we discuss a cubic time algorithm for computing the common ancestors of two given words. This algorithm may be used also for computing the closest or farthest primitive hairpin root of a given word.