Descriptional complexity of semi-simple splicing systems

DOI10.1007/978-3-030-48516-0_12OpenAlexW3028602673MaRDI QIDQ5041256FDOQ5041256

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cited In (8)

• Complexity theory for splicing systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algebraic characterization of semi-simple splicing
• Complexity Theory for Splicing Systems
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• State complexity of simple splicing
• Descriptional Complexity of Semi-Simple 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)