Accepting splicing systems with permitting and forbidding words
From MaRDI portal
Publication:2376984
Recommendations
Cites work
- 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?)
- A helpful result for proving inherent ambiguity
- 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
- Non-context-free grammars generating context-free languages
- On the splicing operation
- Regular splicing languages and subclasses
- Regularity of splicing languages
- Splicing semigroups of dominoes and DNA
Cited in
(5)
This page was built for publication: Accepting splicing systems with permitting and forbidding words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376984)