scientific article; zbMATH DE number 907955
From MaRDI portal
Publication:4886801
zbMATH Open0852.68051MaRDI QIDQ4886801FDOQ4886801
Authors: Lila Kari, Gheorghe Păun, Erzsébet Csuhaj-Varjú 
Publication date: 23 July 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (27)
- Logical string rewriting
- Polarization: a new communication protocol in networks of bio-inspired processors
- Small universal TVDH and test tube systems
- A Formal Framework for Static (Tissue) P Systems
- Universality of Splicing Test Tube Systems with Two Tubes
- Accepting networks of splicing processors: complexity results
- Networks of Polarized Splicing Processors
- Accepting splicing systems
- DNA computing based on splicing: Universality results
- On small, reduced, and fast universal accepting networks of splicing processors
- Length-Separating Test Tube Systems
- Small networks of polarized splicing processors are universal
- Aspects of Molecular Computing
- A general framework for regulated rewriting based on the applicability of rules
- Accepting splicing systems with permitting and forbidding words
- Topics in the theory of DNA computing.
- Networks of splicing processors with evaluation sets as optimization problems solvers
- Universality in Molecular and Cellular Computing
- Title not available (Why is that?)
- Cut, paste and filter.
- Title not available (Why is that?)
- On length-separating test tube systems
- Nine test tubes generate any RE language
- Splicing systems: accepting versus generating
- Splicing systems with targets are computationally universal
- Multiple splicing systems and the universal computability
- Test tube systems: When two tubes are enough
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)
