State complexity of simple splicing

DOI10.1007/978-3-030-23247-4_15MaRDI QIDQ2179338zbMATH OpenOpenAlexFDO

Authors Lila Kari, Timothy Ng

Publication date 12 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-23247-4_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Recommendations

• Descriptional complexity of semi-simple splicing systems
• Descriptional Complexity of Semi-Simple Splicing Systems
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• Deciding whether a regular language is generated by a splicing system
• Simple splicing systems

Cited in

(7)

• Time and space complexity for splicing systems
• Complexity theory for splicing systems
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• Descriptional complexity of semi-simple splicing systems
• Complexity Theory for Splicing Systems
• Probabilistic simple splicing systems
• Descriptional Complexity of Semi-Simple Splicing Systems

This page was built for publication: State complexity of simple splicing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179338)