Non-preserving accepting splicing systems
From MaRDI portal
Recommendations
Cites work
- Accepting splicing systems
- Accepting splicing systems with permitting and forbidding words
- Complexity theory for splicing systems
- Computing by splicing
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
- DNA Computing
- 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
- Formal Reductions of the General Combinatorial Decision Problem
- 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 3305022 (Why is no real title available?)
- Non-preserving splicing with delay
- Regular splicing languages and subclasses
- Regularity of splicing languages
- Small universal Turing machines
- Splicing semigroups of dominoes and DNA
- Universality of Tag Systems with P = 2
Cited in
(4)
This page was built for publication: Non-preserving accepting splicing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5061519)