DNA computing based on splicing: Universality results

DOI10.1016/S0304-3975(99)00104-8zbMath0952.68059OpenAlexW2132951762MaRDI QIDQ1575909

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)

Related Items (6)

Computing with viruses ⋮ Simulating R Systems by P Systems ⋮ Derivation languages and descriptional complexity measures of restricted flat splicing systems ⋮ Frontier between decidability and undecidability: A survey ⋮ A boundary result on enhanced time-varying distributed H systems with parallel computations ⋮ Topics in the theory of DNA computing.

Cites Work

• Splicing systems with targets are computationally universal
• 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
• Small universal Turing machines
• Computing by splicing
• Regularity of splicing languages
• Normal forms for phrase-structure grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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