DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
From MaRDI portal
Publication:3526537
Recommendations
- Descriptional complexity of semi-simple splicing systems
- Descriptional Complexity of Semi-Simple Splicing Systems
- Complexity theory for splicing systems
- Complexity Theory for Splicing Systems
- Splicing systems and the Chomsky hierarchy
- Computational power of weighted splicing systems
- Probabilistic simple splicing systems
- Multiple splicing systems and the universal computability
- State complexity of simple splicing
- Time and space complexity for splicing systems
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Complexity of normal form grammars
- Computing by splicing
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Intersection and union of regular languages and state complexity
- On two-way communication in cellular automata with a fixed number of cells
- Regularity of splicing languages
- Splicing semigroups of dominoes and DNA
Cited in
(13)- Non-preserving accepting splicing systems
- Accepting splicing systems with permitting and forbidding words
- Derivation languages and descriptional complexity measures of restricted flat splicing systems
- State complexity of simple splicing
- Splicing systems: accepting versus generating
- Complexity Theory for Splicing Systems
- Accepting splicing systems
- Combinatorial Pattern Matching
- Descriptional Complexity of Semi-Simple Splicing Systems
- scientific article; zbMATH DE number 1953224 (Why is no real title available?)
- Time and space complexity for splicing systems
- Descriptional complexity of semi-simple splicing systems
- Complexity theory for splicing systems
This page was built for publication: DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526537)
