Direct constructions of universal extended H systems.

DOI10.1016/S0304-3975(02)00658-8zbMath1044.68057MaRDI QIDQ1401272

Pierluigi Frisco

Publication date: 17 August 2003

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

zbMATH Keywords

DNA ComputingDirect universal systemSplicing

Mathematics Subject Classification ID

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

Related Items (2)

Universality in Molecular and Cellular Computing ⋮ Small Universal Devices

Cites Work

• Splicing systems with targets are computationally universal
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Small universal Turing machines
• On the universality of Post and splicing systems
• On the splicing operation
• Restricted use of the splicing operation¹
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Direct constructions of universal extended H systems.