Descriptional Complexity of Semi-Simple Splicing Systems
From MaRDI portal
Publication:6169897
DOI10.1142/S0129054121420041zbMATH Open1518.68112OpenAlexW2971864569MaRDI QIDQ6169897FDOQ6169897
Authors: Lila Kari, Timothy Ng 
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
Recommendations
- Descriptional complexity of semi-simple splicing systems
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
- Complexity theory for splicing systems
- Complexity Theory for Splicing Systems
- Splicing systems and the Chomsky hierarchy
- State complexity of simple splicing
- Probabilistic simple splicing systems
- An algebraic characterization of semi-simple splicing
- Derivation languages and descriptional complexity measures of restricted flat splicing systems
- scientific article; zbMATH DE number 1836435
Cites Work
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Splicing semigroups of dominoes and DNA
- Separating some splicing models.
- On the splicing operation
- Regularity of splicing languages
- Recent advances in formal languages and applications.
- Splicing systems and regularity
- Aspects of Molecular Computing
- Title not available (Why is that?)
- A survey on operational state complexity
- Simple splicing systems
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
- State complexity of simple splicing
- Descriptional complexity of semi-simple splicing systems
Cited In (7)
This page was built for publication: Descriptional Complexity of Semi-Simple Splicing Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169897)
