Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity
Two specific mappings called doublerf d and linearizerf ℓ are introduced to bridge two domains of languages. That is, f d maps string languages into (double-stranded) molecular languages, while f ℓ transforms in the other way around. Using these mappings, we give new characterizations for the families of sticker languages and of Watson-Crick languages, which leads to not only a unified view of the two families of languages but also a clarified view of the computational capability of the DNA complementarity. One of the results implies that any recursively enumerable language can be expressed as the projective image of f d (L) for a minimal linear language L.
KeywordsRegular Language Symmetric Relation Complementary Relation Contextual Grammar Enumerable Language
Unable to display preview. Download preview PDF.
- 5.Salomaa, A.: Turing, Watson-Crick and Lindenmayer: Aspects of DNA Complementarity. In: Unconventional Models of Computation, Auckland, pp. 94–107. Springer, Heidelberg (1998)Google Scholar
- 7.Vliet, R., van Hoogeboon, H.J., Rozenberg, G.: Combinatorial Aspects of Minimal DNA Expressions. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 84–96. Springer, Heidelberg (2005)Google Scholar