In this article, we consider the operations of insertion and deletion working in a graph-
controlled manner. We show that like in the case of context-free productions, the …

We investigate the class of context-free insertion-deletion systems. It is known that such
systems are universal if the length of the inserted/deleted string is at least three. We show …

It was shown in (Verlan, 2005) that complexity measures for insertion-deletion systems need
a revision and new complexity measures taking into account the sizes of both left and right …

This article investigates insertion–deletion systems of small size, where at most two symbols
can be used in the description of insertion or deletion rules in a context-free or contextual …

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 …

As the fabrication of integrated circuits continues to take place on increasingly smaller
scales, we grow closer to several fundamental limitations on electronic computers. For many …

In this paper, we consider insertion–deletion P systems with priority of deletion over
insertion. We show that such systems with one-symbol context-free insertion and deletion …

In this article we continue the investigation of insertion-deletion systems having a context
only on one side of insertion or deletion rules. We show a counterpart of the results obtained …

This paper investigates properties of the binary string and language operation overlap
assembly which was defined by Csuhaj-Varjú, Petre and Vaszil as a formal model of the …

We study the computational power of pure insertion grammars. We show that pure insertion
grammars of weight 3 can characterize all recursively enumerable languages. This is …