Splicing systems: accepting versus generating
From MaRDI portal
Recommendations
Cites work
- Accepting splicing systems
- Computing by splicing
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
- DNA computing based on splicing: The existence of universal computers
- DNA splicing: Computing by observing
- 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 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 907955 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Regular splicing languages and subclasses
- Regularity of splicing languages
- Splicing semigroups of dominoes and DNA
Cited in
(7)- Accepting splicing systems with permitting and forbidding words
- Accepting H iso-array system
- scientific article; zbMATH DE number 1953224 (Why is no real title available?)
- scientific article; zbMATH DE number 2051176 (Why is no real title available?)
- Non-preserving accepting splicing systems
- Networks of splicing processors: simulations between topologies
- Accepting splicing systems
This page was built for publication: Splicing systems: accepting versus generating
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091439)