Topics in the theory of DNA computing.

DOI10.1016/S0304-3975(02)00134-2zbMATH Open1061.68048DBLPjournals/tcs/AmosPRS02OpenAlexW2165819593WikidataQ56210940 ScholiaQ56210940MaRDI QIDQ1853473FDOQ1853473

Authors: Martyn Amos, Arto Salomaa, Gheorghe Păun, Grzegorz Rozenberg 

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

Recommendations

• Publication:4938620
• scientific article; zbMATH DE number 1330034
• scientific article; zbMATH DE number 5526120
• scientific article; zbMATH DE number 1236223
• scientific article; zbMATH DE number 1156876

zbMATH Keywords

DNA computingTuring universalityBoolean circuitsCryptographyDNA moleculesRecursively enumerable languagesMolecular computingSplicing systemsBiomolecular tool box

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Computing with membranes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• DNA computing based on splicing: Universality results
• Title not available (Why is that?)
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Splicing semigroups of dominoes and DNA
• Regularity of splicing languages
• A guide to membrane computing.
• Title not available (Why is that?)
• Computing by splicing
• Sequences of languages in forbidding-enforcing families
• Forbidding--enforcing systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Aspects of Molecular Computing
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simulating Boolean circuits on a DNA computer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Splicing in abstract families of languages
• Title not available (Why is that?)
• TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
• Nine test tubes generate any RE language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• DNA-based logic
• A CONSTANT TIME ALGORITHM FOR DNA ADD
• Circular suggestions for DNA computing
• THE INFERENCE BASED ON MOLECULAR COMPUTING
• Title not available (Why is that?)
• A genetic algorithm using triplet nucleotide encoding and DNA reproduction operations for unconstrained optimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Topics in the theory of DNA computing.

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