Descriptional complexity of semi-simple splicing systems

DOI10.1007/978-3-030-48516-0_12MaRDI QIDQ5041256zbMATH OpenOpenAlexFDO

Authors Lila Kari, Timothy Ng

Publication date 13 October 2022

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.02512

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Descriptional Complexity of Semi-Simple Splicing Systems
• State complexity of simple splicing
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• scientific article; zbMATH DE number 1836435
• A characterization of regular circular languages generated by marked splicing systems

Cites work

• scientific article; zbMATH DE number 1836435 (Why is no real title available?)
• A survey on operational state complexity
• Aspects of Molecular Computing
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• On the splicing operation
• Recent advances in formal languages and applications.
• Regularity of splicing languages
• Separating some splicing models.
• Simple splicing systems
• Splicing semigroups of dominoes and DNA
• Splicing systems and regularity
• State complexity of simple splicing

Cited in

(9)

• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• State complexity of simple splicing
• Probabilistic simple splicing systems
• Complexity Theory for Splicing Systems
• Descriptional Complexity of Semi-Simple Splicing Systems
• scientific article; zbMATH DE number 1836435 (Why is no real title available?)
• An algebraic characterization of semi-simple splicing
• scientific article; zbMATH DE number 1574489 (Why is no real title available?)
• Complexity theory for splicing systems

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 Q5041256)