DNA computing based on splicing: Universality results

DOI10.1016/S0304-3975(99)00104-8MaRDI QIDQ1575909zbMATH OpenOpenAlexFDO

Authors Gheorghe Păun

Publication date 23 August 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00104-8

zbMATH Keywords

splicingH systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1086502
• scientific article; zbMATH DE number 1189119
• DNA computing based on splicing: The existence of universal computers
• scientific article; zbMATH DE number 1286204

Cites work

• scientific article; zbMATH DE number 992003 (Why is no real title available?)
• scientific article; zbMATH DE number 1004368 (Why is no real title available?)
• scientific article; zbMATH DE number 3742650 (Why is no real title available?)
• scientific article; zbMATH DE number 58295 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1342098 (Why is no real title available?)
• scientific article; zbMATH DE number 1086502 (Why is no real title available?)
• scientific article; zbMATH DE number 1098499 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 745858 (Why is no real title available?)
• scientific article; zbMATH DE number 907955 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Computing by splicing
• DNA computing based on splicing: The existence of universal computers
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Normal forms for phrase-structure grammars
• Regularity of splicing languages
• Small universal Turing machines
• Splicing semigroups of dominoes and DNA
• Splicing systems with targets are computationally universal

Cited in

(27)

• scientific article; zbMATH DE number 1543347 (Why is no real title available?)
• DNA computing based on splicing: The existence of universal computers
• Computing with viruses
• On enhanced time-varying distributed H systems
• DNA splicing: Computing by observing
• TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
• scientific article; zbMATH DE number 1086502 (Why is no real title available?)
• scientific article; zbMATH DE number 1953230 (Why is no real title available?)
• scientific article; zbMATH DE number 1189119 (Why is no real title available?)
• Frontier between decidability and undecidability: A survey
• A boundary result on enhanced time-varying distributed H systems with parallel computations
• Simulating R Systems by P Systems
• DNA Computing
• scientific article; zbMATH DE number 5257484 (Why is no real title available?)
• Non-preserving splicing with delay
• Topics in the theory of DNA computing.
• Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication
• scientific article; zbMATH DE number 1836440 (Why is no real title available?)
• scientific article; zbMATH DE number 1738640 (Why is no real title available?)
• scientific article; zbMATH DE number 1735661 (Why is no real title available?)
• scientific article; zbMATH DE number 1189124 (Why is no real title available?)
• scientific article; zbMATH DE number 1189127 (Why is no real title available?)
• Derivation languages and descriptional complexity measures of restricted flat splicing systems
• DNA Computing
• Membrane Computing
• Multiple splicing systems and the universal computability
• An alternative definition of splicing

This page was built for publication: DNA computing based on splicing: Universality results

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