Splicing systems with targets are computationally universal

DOI10.1016/0020-0190(96)00097-XMaRDI QIDQ671404zbMATH OpenOpenAlexFDO

Authors Gheorghe Păun

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00097-x

zbMATH Keywords

DNA computingFormal languagesH systemSplicing operationTheory of computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• DNA Computing
• scientific article; zbMATH DE number 1004368
• On the power of the splicing operation¹
• Multiple splicing systems and the universal computability
• scientific article; zbMATH DE number 992003

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 2013200 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 907955 (Why is no real title available?)
• scientific article; zbMATH DE number 908772 (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
• On the splicing operation
• On the universality of Post and splicing systems
• Regularity of splicing languages
• Restricted use of the splicing operation¹
• Splicing semigroups of dominoes and DNA

Cited in

(8)

• Derivation languages and descriptional complexity measures of restricted flat splicing systems
• Recognizing DNA Splicing
• Direct constructions of universal extended H systems.
• Multiple splicing systems and the universal computability
• DNA Computing
• DNA computing based on splicing: Universality results
• Graph splicing systems
• DNA splicing: Computing by observing

This page was built for publication: Splicing systems with targets are computationally universal

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