DNA computing based on splicing: The existence of universal computers
From MaRDI portal
Publication:1277368
DOI10.1007/S002240000112zbMath0914.68072OpenAlexW2078808192MaRDI QIDQ1277368
Gheorghe Păun, Rudolf Freund, Lila Kari
Publication date: 21 June 1999
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000112
Related Items (18)
Insertion-deletion systems with substitutions I ⋮ Accepting splicing systems with permitting and forbidding words ⋮ A Brief Tour of Theoretical Tile Self-Assembly ⋮ DNA computing: Arrival of biological mathematics ⋮ Aparallel digraphs and splicing machines ⋮ Splicing systems with targets are computationally universal ⋮ Unnamed Item ⋮ Accepting splicing systems ⋮ Multiple splicing systems and the universal computability ⋮ Graph splicing systems ⋮ P SYSTEMS WITH PROTEINS ON MEMBRANES: A SURVEY ⋮ Derivation languages and descriptional complexity measures of restricted flat splicing systems ⋮ Splicing Systems: Accepting Versus Generating ⋮ Splicing on tree-like structures ⋮ Sticker systems ⋮ DNA computing based on splicing: Universality results ⋮ On the universality of Post and splicing systems ⋮ Using DNA to solve the bounded Post correspondence problem
This page was built for publication: DNA computing based on splicing: The existence of universal computers
