Splicing systems with targets are computationally universal

DOI10.1016/0020-0190(96)00097-XzbMath0875.68603OpenAlexW2098622378MaRDI QIDQ671404

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)

Related Items (5)

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

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• DNA computing based on splicing: The existence of universal computers
• Computing by splicing
• On the universality of Post and splicing systems
• On the splicing operation
• Regularity of splicing languages
• Restricted use of the splicing operation¹
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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