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 …

A graph-controlled insertion–deletion system is a regulated extension of an insertion–
deletion system. It has several components and each component contains some insertion …

We study matrix insertion grammars (MIS) towards representation of recursively enumerable
languages with small size. We show that pure MIS of size (3; 1, 2, 2)(ie, having ternary …

In this article we introduce the operations of insertion and deletion working in random
context and semi-conditional modes. We show that conditional application of insertion and …

Matrix insertion-deletion systems combine the idea of matrix control (a control mechanism
well established in regulated rewriting) with that of insertion and deletion (as opposed to …

A graph-controlled insertion–deletion (GCID) system is a regulated extension of an insertion–
deletion system. Such a system has several components and each component has some …

A regulated extension of an insertion-deletion system known as graph-controlled insertion-
deletion (GCID) system has several components and each component contains some …

In this paper we investigate the operations of insertion and deletion performed at the ends of
a string. We show that using these operations in a P systems framework (which corresponds …

Insertion-deletion (or ins-del for short) systems are well studied in formal language theory,
especially regarding their computational completeness. The need for many variants on ins …

A graph-controlled insertion-deletion (GCID) system has several components and each
component contains some insertion-deletion rules. A transition is performed by any …