scientific article; zbMATH DE number 907955
From MaRDI portal
Publication:4886801
Recommendations
Cited in
(28)- On small, reduced, and fast universal accepting networks of splicing processors
- DNA computing based on splicing: Universality results
- Nine test tubes generate any RE language
- Cut, paste and filter.
- Topics in the theory of DNA computing.
- Networks of splicing processors with evaluation sets as optimization problems solvers
- Polarization: a new communication protocol in networks of bio-inspired processors
- Accepting splicing systems with permitting and forbidding words
- Test tube systems: When two tubes are enough
- A general framework for regulated rewriting based on the applicability of rules
- Small universal TVDH and test tube systems
- Splicing systems: accepting versus generating
- Universality of Splicing Test Tube Systems with Two Tubes
- Universality in Molecular and Cellular Computing
- scientific article; zbMATH DE number 1286204 (Why is no real title available?)
- scientific article; zbMATH DE number 1134605 (Why is no real title available?)
- Networks of Polarized Splicing Processors
- Non-preserving accepting splicing systems
- A Formal Framework for Static (Tissue) P Systems
- Length-Separating Test Tube Systems
- Aspects of Molecular Computing
- Multiple splicing systems and the universal computability
- Logical string rewriting
- Small networks of polarized splicing processors are universal
- Splicing systems with targets are computationally universal
- Accepting networks of splicing processors: complexity results
- On length-separating test tube systems
- Accepting splicing systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886801)
