Insertion-deletion systems with substitutions. I

DOI10.1007/978-3-030-51466-2_33MaRDI QIDQ2106623zbMATH OpenOpenAlexFDO

Authors Martin Vu, Henning Fernau

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-51466-2_33

zbMATH Keywords

computational completenesscontext-sensitivedeletionsinsertionssubstitutions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Insertion-deletion with substitutions. II
• Insertion-deletion systems with substitutions. I
• Insertion-deletion with substitutions. II: About the role of one-sided context
• Adding matrix control: insertion-deletion systems with substitutions. III
• Small size insertion and deletion systems

Cites work

• Computational power of insertion-deletion (P) systems with rules of size two
• Context-free insertion-deletion systems
• DNA computing: Arrival of biological mathematics
• Further Results on Insertion-Deletion Systems with One-Sided Contexts
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• Insertion-Deletion Systems with One-Sided Contexts
• On minimal context-free insertion-deletion systems
• On the computational power of insertion-deletion systems
• Recent developments on insertion-deletion systems
• Small size insertion and deletion systems

Cited in

(5)

• Insertion-deletion systems with substitutions. I
• Insertion-deletion with substitutions. II: About the role of one-sided context
• Recent developments on insertion-deletion systems
• Adding matrix control: insertion-deletion systems with substitutions. III
• Parsimonious computational completeness

This page was built for publication: Insertion-deletion systems with substitutions. I

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