DNA computing by matching: sticker systems and Watson-Crick automata

MaRDI QIDQ5457219zbMATH OpenFDO

Authors Gheorghe Păun

Publication date 14 April 2008

zbMATH Keywords

Sticker Systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• DNA computing, sticker systems, and universality
• Sticker systems
• Sticker systems with complex structures
• Parallel communicating Watson-Crick automata systems
• Watson-Crick automata: Theoretical computational models in DNA computing

Cited in

(12)

• Sticker DNA computer model. II: Application
• scientific article; zbMATH DE number 1189114 (Why is no real title available?)
• scientific article; zbMATH DE number 2089955 (Why is no real title available?)
• The generative power of weighted one-sided and regular sticker systems
• Developments in Language Theory
• A formal model for databases in DNA
• Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity
• scientific article; zbMATH DE number 1351098 (Why is no real title available?)
• Theorem proving and DNA computing
• Watson-Crick automata: Theoretical computational models in DNA computing
• Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity
• Sticker systems with complex structures

This page was built for publication: DNA computing by matching: sticker systems and Watson-Crick automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5457219)