Recent Developments on Insertion-Deletion Systems

Abstract

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 series of results concerning language properties, decidability and computational completeness of families of languages generated by insertion-deletion systems and their extensions with the graph-control. The basic proof methods are presented and the proofs for the most important results are sketched.

Keywords

• insertion-deletion systems
• computational completeness
• decidability
• graph control
• P systems