DNA Complementarity and Paradigms of Computing

Authors:
Arto Salomaa
Affiliations:
-
Venue:
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Year:
2002

Citing 10
Cited 0

Formal languages

Formal languages
Molecular computation of solutions to combinatorial problems

Science
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Watson-Crick walks and roads on DOL graphs

Acta Cybernetica
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Journal of the ACM (JACM)
Language-theoretic aspects of DNA complementarity

Theoretical Computer Science
Watson—Crick DOL systems with regular triggers

Theoretical Computer Science
DNA Computing: New Ideas and Paradigms

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
D0L System + Watson-Crick Complementarity = Universal Computation

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Uni-Transitional Watson-Crick D0L Systems

Uni-Transitional Watson-Crick D0L Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Watson-Crick complementarity is one of the central components of DNA computing, the other central component being the massive parallelism of DNA strands. While the parallelism drastically reduces (provided the laboratory techniques will become adequate) the computational complexity, the complementarity is the actual computational tool "freely" available. It is also the cause behind the Turing universality of models of DNA computing. This paper makes this cause explicit, reducing the matter to some previously known issues in computability theory. We also discuss some specific models.