Topics in the theory of DNA computing.
DOI10.1016/S0304-3975(02)00134-2zbMath1061.68048OpenAlexW2165819593WikidataQ56210940 ScholiaQ56210940MaRDI QIDQ1853473
Martyn Amos, Arto Salomaa, Grzegorz Rozenberg, Gheorghe Păun
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00134-2
CryptographyDNA computingTuring universalityBoolean circuitsDNA moleculesRecursively enumerable languagesMolecular computingSplicing systemsBiomolecular tool box
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)
Related Items (2)
Cites Work
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Simulating Boolean circuits on a DNA computer
- Splicing semigroups of dominoes and DNA
- Computing by splicing
- Splicing in abstract families of languages
- DNA computing based on splicing: Universality results
- Nine test tubes generate any RE language
- Computing with membranes
- Sequences of languages in forbidding-enforcing families
- A guide to membrane computing.
- Forbidding--enforcing systems
- Regularity of splicing languages
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
- Aspects of Molecular Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Topics in the theory of DNA computing.
