ON SMALL UNIVERSAL SPLICING SYSTEMS
From MaRDI portal
Recommendations
- A small universal splicing P system
- scientific article; zbMATH DE number 935111
- DNA Computing
- scientific article; zbMATH DE number 1836435
- On small, reduced, and fast universal accepting networks of splicing processors
- Simple splicing systems
- On the universality of Post and splicing systems
- Multiple splicing systems and the universal computability
- Small networks of polarized splicing processors are universal
- Algorithms for Splicing Systems
Cites work
- A boundary result on enhanced time-varying distributed H systems with parallel computations
- A small universal splicing P system
- Computing with membranes
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- scientific article; zbMATH DE number 1102592 (Why is no real title available?)
- On length-separating test tube systems
- On small universal antiport P systems
- Small universal Turing machines
- Small universal TVDH and test tube systems
- Universality of Tag Systems with P = 2
Cited in
(10)- On the universality of Post and splicing systems
- Small universal devices
- A small universal splicing P system
- Small universal TVDH and test tube systems
- Universality in Molecular and Cellular Computing
- scientific article; zbMATH DE number 1735637 (Why is no real title available?)
- DNA Computing
- Membrane Computing
- Aspects of Molecular Computing
- Small networks of polarized splicing processors are universal
This page was built for publication: ON SMALL UNIVERSAL SPLICING SYSTEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923288)
