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

DOI10.1007/S11047-007-9057-5zbMath1146.68373OpenAlexW2035406817MaRDI QIDQ926525

Kaoru Onodera, Takashi Yokomori

Publication date: 20 May 2008

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-007-9057-5

zbMATH Keywords

mappingrecursively enumerable languagemolecular languagesticker systemwatson-crick finite automaton

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• DNA computing, sticker systems, and universality
• Fair sticker languages
• Sticker systems with complex structures
• Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity
• DNA Computing
• Developments in Language Theory

This page was built for publication: Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity