scientific article
From MaRDI portal
Publication:3125167
zbMath0867.68043MaRDI QIDQ3125167
Publication date: 16 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Accepting splicing systems with permitting and forbidding words ⋮ Networks of Polarized Splicing Processors ⋮ Simple splicing systems ⋮ Small networks of polarized splicing processors are universal ⋮ Some wonders of a bio-computer-scientist ⋮ Direct constructions of universal extended H systems. ⋮ Time and space complexity for splicing systems ⋮ Complexity theory for splicing systems ⋮ Splicing systems with targets are computationally universal ⋮ Unnamed Item ⋮ Template-guided DNA recombination ⋮ Accepting splicing systems ⋮ Multiple splicing systems and the universal computability ⋮ Graph splicing systems ⋮ Formal properties of PA-matching ⋮ DNA Splicing Systems ⋮ On small, reduced, and fast universal accepting networks of splicing processors ⋮ On Computational Properties of Template-Guided DNA Recombination ⋮ Polarization: a new communication protocol in networks of bio-inspired processors ⋮ Cut, paste and filter. ⋮ Splicing Systems: Accepting Versus Generating ⋮ Sticker systems ⋮ Splicing in abstract families of languages ⋮ DNA computing based on splicing: Universality results ⋮ On the universality of Post and splicing systems ⋮ A boundary result on enhanced time-varying distributed H systems with parallel computations ⋮ Topics in the theory of DNA computing.
This page was built for publication:
