Linearizer and doubler: two mappings to unify molecular computing models based on DNA complementarity

  • Authors:

  • Kaoru Onodera;Takashi Yokomori

  • Affiliations:

  • Mathematics Major, Graduate School of Education, Waseda University, Tokyo, Japan;Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, Tokyo, Japan

  • Venue:
  • DNA'05 Proceedings of the 11th international conference on DNA Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two specific mappings called doublerfd and linearizerfℓ are introduced to bridge two domains of languages. That is, fd 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 fd(L) for a minimal linear language L.