Topics in the theory of DNA computing.
type: Item
instance of: scholarly article
title: Topics in the theory of DNA computing.
zbMATH Open document ID: 1061.68048
DOI: 10.1016/S0304-3975(02)00134-2
author: Martyn Amos
author: Arto Salomaa
author: Gheorghe Păun
author: Grzegorz Rozenberg
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 1857020
zbMATH Keywords: DNA molecules
zbMATH Keywords: Biomolecular tool box
zbMATH Keywords: DNA computing
zbMATH Keywords: Molecular computing
zbMATH Keywords: Turing universality
zbMATH Keywords: Recursively enumerable languages
zbMATH Keywords: Boolean circuits
zbMATH Keywords: Cryptography
zbMATH Keywords: Splicing systems
MaRDI profile type: Publication
Wikidata QID: Q56210940
cites work: Q4763798
cites work: Q4886801
cites work: Splicing semigroups of dominoes and DNA
cites work: Q4886794
cites work: Q3994882
cites work: Q4762332
cites work: Sequences of languages in forbidding-enforcing families
cites work: Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
cites work: Forbidding--enforcing systems
cites work: Nine test tubes generate any RE language
cites work: Aspects of Molecular Computing
cites work: Q5593643
cites work: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
cites work: Q4737679
cites work: Q4782127
cites work: TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
cites work: Q4242718
cites work: Simulating Boolean circuits on a DNA computer
cites work: Q3125167
cites work: Q4362740
cites work: Q3838831
cites work: Q4267178
cites work: DNA computing based on splicing: Universality results
cites work: Computing with membranes
cites work: A guide to membrane computing.
cites work: Computing by splicing
cites work: Q4223673
cites work: Regularity of splicing languages
cites work: Splicing in abstract families of languages
cites work: Q4224876
cites work: Q4140407
cites work: Q4938620
cites work: Q3948608
cites work: Q2785557
cites work: Q3838826
cites work: Q4869527
cites work: Q3762226
full work available at URL: s0304-3975(02)00134-2
OpenAlex ID: W2165819593
DBLP publication ID: journals/tcs/AmosPRS02
description: scientific article; zbMATH DE number 1857020