Publication:3125167
From MaRDI portal
zbMath0867.68043MaRDI QIDQ3125167
Publication date: 16 March 1997
Related Items
DNA Splicing Systems, Multiple splicing systems and the universal computability, Formal properties of PA-matching, Splicing systems with targets are computationally universal, Accepting splicing systems, On small, reduced, and fast universal accepting networks of splicing processors, Sticker systems, Simple splicing systems, Direct constructions of universal extended H systems., Splicing in abstract families of languages, DNA computing based on splicing: Universality results, On the universality of Post and splicing systems, Template-guided DNA recombination, Cut, paste and filter., Topics in the theory of DNA computing., Time and space complexity for splicing systems, Polarization: a new communication protocol in networks of bio-inspired processors, Accepting splicing systems with permitting and forbidding words, Complexity theory for splicing systems, Graph splicing systems, A boundary result on enhanced time-varying distributed H systems with parallel computations, Splicing Systems: Accepting Versus Generating, On Computational Properties of Template-Guided DNA Recombination