Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity

Kaoru Onodera*, Takashi Yokomori

*この研究の対応する著者

研究成果: Article査読

1 被引用数 (Scopus)

抄録

Two specific mappings called doubler f d and linearizer f e are introduced to bridge between two kinds of languages. Specifically, f d maps string languages into (double-stranded) molecular languages, while f e performs the opposite mapping. Using these mappings, we obtain new characterizations for the families of sticker languages and of Watson-Crick languages, which lead to not only a unified view of the two families of languages but also provide a helpful view on the computational capability of DNA complementarity. Furthermore, we introduce a special type of a projection f pr which is composed of f d and a projection in the usual sense. We show that any recursively enumerable language L can be expressed as f pr(L m) for a minimal linear language L m. This result can be strengthened to L = f p(L s), for a specific form of minimal linear language L s, which provides a simple morphic characterization for the family of recursively enumerable languages.

本文言語English
ページ(範囲)125-143
ページ数19
ジャーナルNatural Computing
7
1
DOI
出版ステータスPublished - 2008 3月
外部発表はい

ASJC Scopus subject areas

  • コンピュータ サイエンスの応用

フィンガープリント

「Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル