Insertion-deletion systems with substitutions. I

DOI10.1007/978-3-030-51466-2_33OpenAlexW3037192171MaRDI QIDQ2106623FDOQ2106623

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

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

zbMATH Keywords

computational completenesscontext-sensitivesubstitutionsdeletionsinsertions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Context-free insertion-deletion systems
• Title not available (Why is that?)
• Computational power of insertion-deletion (P) systems with rules of size two
• Recent developments on insertion-deletion systems
• DNA computing: Arrival of biological mathematics
• On the computational power of insertion-deletion systems
• On minimal context-free insertion-deletion systems
• Further Results on Insertion-Deletion Systems with One-Sided Contexts
• Insertion-Deletion Systems with One-Sided Contexts
• Small size insertion and deletion systems

Cited In (5)

• Parsimonious computational completeness
• Recent developments on insertion-deletion systems
• 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

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)