DNA computing based on splicing: Universality results
From MaRDI portal
Recommendations
Cites work
- Computing by splicing
- DNA computing based on splicing: The existence of universal computers
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- scientific article; zbMATH DE number 992003 (Why is no real title available?)
- scientific article; zbMATH DE number 1004368 (Why is no real title available?)
- scientific article; zbMATH DE number 3742650 (Why is no real title available?)
- scientific article; zbMATH DE number 58295 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1342098 (Why is no real title available?)
- scientific article; zbMATH DE number 1086502 (Why is no real title available?)
- scientific article; zbMATH DE number 1098499 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 745858 (Why is no real title available?)
- scientific article; zbMATH DE number 907955 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Normal forms for phrase-structure grammars
- Regularity of splicing languages
- Small universal Turing machines
- Splicing semigroups of dominoes and DNA
- Splicing systems with targets are computationally universal
Cited in
(30)- DNA computing based on splicing: The existence of universal computers
- On enhanced time-varying distributed H systems
- Frontier between decidability and undecidability: A survey
- Topics in the theory of DNA computing.
- Derivation languages and descriptional complexity measures of restricted flat splicing systems
- An alternative definition of splicing
- A boundary result on enhanced time-varying distributed H systems with parallel computations
- Computing with viruses
- Simulating R Systems by P Systems
- scientific article; zbMATH DE number 992003 (Why is no real title available?)
- scientific article; zbMATH DE number 1004368 (Why is no real title available?)
- Communicating Distributed H Systems: Optimal Results with Efficient Ways of Communication
- scientific article; zbMATH DE number 1189119 (Why is no real title available?)
- scientific article; zbMATH DE number 1189124 (Why is no real title available?)
- scientific article; zbMATH DE number 1189127 (Why is no real title available?)
- scientific article; zbMATH DE number 1343486 (Why is no real title available?)
- scientific article; zbMATH DE number 1735661 (Why is no real title available?)
- scientific article; zbMATH DE number 1086502 (Why is no real title available?)
- scientific article; zbMATH DE number 1953230 (Why is no real title available?)
- scientific article; zbMATH DE number 1543347 (Why is no real title available?)
- scientific article; zbMATH DE number 1738640 (Why is no real title available?)
- scientific article; zbMATH DE number 1836440 (Why is no real title available?)
- TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES
- Non-preserving splicing with delay
- scientific article; zbMATH DE number 5257484 (Why is no real title available?)
- DNA Computing
- DNA Computing
- Membrane Computing
- Multiple splicing systems and the universal computability
- DNA splicing: Computing by observing
This page was built for publication: DNA computing based on splicing: Universality results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575909)
