DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
From MaRDI portal
Publication:3526537
DOI10.1142/S0129054108005978zbMATH Open1156.68032OpenAlexW2110977739MaRDI QIDQ3526537FDOQ3526537
Authors: Remco Loos, Andreas Malcher, Detlef Wotschke 
Publication date: 25 September 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054108005978
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
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Title not available (Why is that?)
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Splicing semigroups of dominoes and DNA
- Regularity of splicing languages
- Complexity of normal form grammars
- Computing by splicing
- Intersection and union of regular languages and state complexity
- On two-way communication in cellular automata with a fixed number of cells
Cited In (13)
- Complexity theory for splicing systems
- Descriptional complexity of semi-simple splicing systems
- Non-preserving accepting splicing systems
- Accepting splicing systems
- Accepting splicing systems with permitting and forbidding words
- Complexity Theory for Splicing Systems
- Combinatorial Pattern Matching
- Title not available (Why is that?)
- State complexity of simple splicing
- Time and space complexity for splicing systems
- Derivation languages and descriptional complexity measures of restricted flat splicing systems
- Splicing systems: accepting versus generating
- Descriptional Complexity of Semi-Simple 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)
