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 …

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 …

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 …

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 …

Small Size Insertion and Deletion Systems. Page 471 Chapter 9 Small Size Insertion and
Deletion Systems Artiom Alhazov1 IEC, Department of Information Engineering, Graduate School …

Recent investigations show insertion-deletion systems of small size that are not complete
and cannot generate all recursively enumerable languages. However, if additional …

This paper focuses on P systems with one-symbol insertion and deletion without contexts.
The main aim of this paper is to consider the operations applied at the ends of the string, and …

COMPLEXITY AND MODELING POWER OF INSERTION-DELETION SYSTEMS The central
object of the thesis are insertion-deletion systems and their computational power. More …

It is known that insertion-deletion (P) systems with two symbols context-free insertion and
deletion rules are not computationally complete. It is thus interesting to consider conditions …

In this article we investigate insertion systems of small size in the framework of P systems.
We consider P systems with insertion rules having one symbol context and we show that …