Multiple splicing systems and the universal computability

DOI10.1016/S0304-3975(00)00211-5MaRDI QIDQ5941559zbMATH OpenFDO

Authors Satoshi Kobayashi, Y. Sakakibara

Publication date 20 August 2001

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

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00211-5

zbMATH Keywords

computabilityDNA computingsplicing system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Splicing systems with targets are computationally universal
• scientific article; zbMATH DE number 1004368
• On the universality of Post and splicing systems
• DNA computing based on splicing: The existence of universal computers
• DNA computing based on splicing: Universality results

Cites work

• 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
• Formal Reductions of the General Combinatorial Decision Problem
• scientific article; zbMATH DE number 992003 (Why is no real title available?)
• scientific article; zbMATH DE number 3902039 (Why is no real title available?)
• scientific article; zbMATH DE number 1189119 (Why is no real title available?)
• scientific article; zbMATH DE number 1086502 (Why is no real title available?)
• scientific article; zbMATH DE number 907955 (Why is no real title available?)
• Monadic Elementary Formal Systems
• On the splicing operation
• Prefix grammars: An alternative characterization of the regular languages
• Regularity of splicing languages

Cited in

(8)

• On the universality of Post and splicing systems
• Graph splicing systems
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• scientific article; zbMATH DE number 1735661 (Why is no real title available?)
• scientific article; zbMATH DE number 935111 (Why is no real title available?)
• ON SMALL UNIVERSAL SPLICING SYSTEMS
• Complexity Theory for Splicing Systems
• Splicing systems with targets are computationally universal

This page was built for publication: Multiple splicing systems and the universal computability

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