DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS

DOI10.1142/S0129054108005978zbMath1156.68032OpenAlexW2110977739MaRDI 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)

Full work available at URL: https://doi.org/10.1142/s0129054108005978

zbMATH Keywords

DNA computingminimal nondeterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (6)

Descriptional Complexity of Semi-simple Splicing Systems ⋮ Accepting splicing systems with permitting and forbidding words ⋮ Descriptional Complexity of Semi-Simple Splicing Systems ⋮ Unnamed Item ⋮ Accepting splicing systems ⋮ 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

This page was built for publication: DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS