Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity

  • Kaoru Onodera
  • Takashi Yokomori
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3892)


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.


Regular Language Symmetric Relation Complementary Relation Contextual Grammar Enumerable Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hoogeboom, H.J., Vugt, N.V.: Fair sticker languages. Acta Informatica 37, 213–225 (2000)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Păun, G.: Marcus contextual grammar. Kluwer Academic Publishers, Dordrecht (1997)CrossRefMATHGoogle Scholar
  3. 3.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Heidelberg (1998)MATHGoogle Scholar
  4. 4.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)MATHGoogle Scholar
  5. 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
  6. 6.
    Sakakibara, Y., Kobayashi, S.: Sticker systems with complex structures. Soft Computing 5, 114–120 (2001)CrossRefMATHGoogle Scholar
  7. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kaoru Onodera
    • 1
  • Takashi Yokomori
    • 2
  1. 1.Mathematics Major, Graduate School of EducationWaseda UniversityTokyoJapan
  2. 2.Department of Mathematics, Faculty of Education and Integrated Arts and SciencesWaseda UniversityTokyoJapan

Personalised recommendations