Where academic tradition
meets the exciting future

Matrix Insertion–Deletion Systems

Ion Petre, Sergey Verlan, Matrix Insertion–Deletion Systems. Theoretical Computer Science 456, 80–88, 2012.

Abstract:

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.

BibTeX entry:

@ARTICLE{jPeVe12a,
  title = {Matrix Insertion–Deletion Systems},
  author = {Petre, Ion and Verlan, Sergey},
  journal = {Theoretical Computer Science},
  volume = {456},
  publisher = {Elsevier},
  pages = {80–88},
  year = {2012},
  keywords = {Insertion–deletion systems; Matrix control; Formal languages; Computational completeness},
}

Belongs to TUCS Research Unit(s): Computational Biomodeling Laboratory (Combio Lab)

Publication Forum rating of this publication: level 2

Edit publication