Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-12-23
Computer Science
Formal Languages and Automata Theory
Scientific paper
In this article, we consider for the first time the operations of insertion and deletion working in a matrix controlled manner. We show that, similarly as in the case of context-free productions, the computational power is strictly increased when using a matrix control: computational completeness can be obtained by systems with insertion or deletion rules involving at most two symbols in a contextual or in a context-free manner and using only binary matrices.
Petre Ion
Verlan Sergey
No associations
LandOfFree
Matrix Insertion-Deletion Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Matrix Insertion-Deletion Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matrix Insertion-Deletion Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-296973