Matrix insertion–deletion systems

We investigate in this article the operations of insertion and deletion working in a matrix-controlled manner. We show that this allows to us strictly increase the computational power: in the case of systems that are not computationally complete (with total size equal to 4), the computational completeness can be obtained by introducing the matrix control and using only binary matrices.

Authors

• Ion Petre
• Sergey Verlan

Keywords

• Insertion–deletion systems
• Matrix control
• Formal languages
• Computational completeness