Descriptional Complexity of Semi-Simple Splicing Systems

DOI10.1142/s0129054121420041zbMath1518.68112OpenAlexW2971864569MaRDI QIDQ6169897

Timothy Ng, Lila Kari

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

DNA computingsplicing systemsdescriptional complexity

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• Simple splicing systems
• Separating some splicing models.
• On the splicing operation
• Regularity of splicing languages
• State complexity of simple splicing
• Recent advances in formal languages and applications.
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• Splicing systems and regularity
• Descriptional Complexity of Semi-simple Splicing Systems
• Aspects of Molecular Computing

This page was built for publication: Descriptional Complexity of Semi-Simple Splicing Systems