This article gives an overview of the recent developments in the study of the operations of
insertion and deletion. It presents the origin of these operations, their formal definition and a …

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 …

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 …

Factorizing composite number n= qr, where q and r are two large primes, and finding
discrete logarithm modulo large prime number p are two difficult computational problems …

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 …

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 …

Résumé Nos travaux de recherche se situent dans le domaine de la théorie des langages
formels. Cependant, l'objet de nos études sont les opérations sur les mots et les modèles de …