DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
From MaRDI portal
Publication:3526537
DOI10.1142/S0129054108005978zbMath1156.68032MaRDI QIDQ3526537
Andreas Malcher, Remco Loos, Detlef Wotschke
Publication date: 25 September 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Accepting splicing systems, Accepting splicing systems with permitting and forbidding words, Splicing Systems: Accepting Versus Generating
Cites Work
- Unnamed Item
- Complexity of normal form grammars
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Splicing semigroups of dominoes and DNA
- Intersection and union of regular languages and state complexity
- Computing by splicing
- On two-way communication in cellular automata with a fixed number of cells
- Regularity of splicing languages