Power of Controlled Insertion and Deletion

The paper investigates classes of languages obtained as the closure of certain atomic languages under some insertion and deletion operations. Each of the classes studied is closed under an insertion operation, a deletion operation and an iterative insertion one. The operations are controlled and have been chosen as stated in order to allow an increase as well as a decrease of the length of the words in the operands. The iterative operation has been included in each class to provide an infinite growth of the strings.

[1]  Lila Kari,et al.  Generalized Derivatives , 1993, Fundam. Informaticae.

[2]  Lila Kari,et al.  Insertion and Deletion of Words: Determinism and Reversibility , 1992, MFCS.

[3]  L. Santean,et al.  Six Arithmetic-Like Operations on Languages , 1988 .

[4]  Gheorghe Paun,et al.  On Parallel Deletions Applied to a Word , 1995, RAIRO Theor. Informatics Appl..

[5]  Ronald V. Book,et al.  Monadic Thue Systems , 1982, Theor. Comput. Sci..

[6]  Lila Kari,et al.  On Insertion and Deletion in Formal Languages , 1991 .

[7]  Peter C. Chapin.  Formal languages I , 1973, CSC '73.

[8]  Gheorghe Paun,et al.  Deletion Sets , 1993, Fundam. Informaticae.