Adding matrix control: insertion-deletion systems with substitutions. III

DOI10.1007/978-3-030-67731-2_42zbMath1490.68133OpenAlexW3121708398MaRDI QIDQ831848

Henning Fernau, Martin Vu

Publication date: 24 March 2022

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

zbMATH Keywords

substitutionscomputational completenessdeletionsinsertionsmatrix control

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

Insertion-deletion systems with substitutions I ⋮ On the generative capacity of matrix insertion-deletion systems of small sum-norm ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational power of insertion-deletion (P) systems with rules of size two
• P systems with minimal insertion and deletion
• Recent developments on insertion-deletion systems
• Matrix insertion-deletion systems
• Petri net algorithms in the theory of matrix grammars
• DNA computing: Arrival of biological mathematics
• Insertion-deletion with substitutions. II
• Insertion-deletion systems with substitutions. I
• On matrix ins-del systems of small sum-norm
• On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes

This page was built for publication: Adding matrix control: insertion-deletion systems with substitutions. III