Computational Power of P Systems with Small Size Insertion and Deletion Rules

Recent investigations show insertion-deletion systems of small size that are not complete and cannot generate all recursively enumerable languages. However, if additional computational distribution mechanisms like P systems are added, then the computational completeness is achieved in some cases. In this article we take two insertion-deletion systems that are not computationally complete, consider them in the framework of P systems and show that the computational power is strictly increased by proving that any recursively enumerable language can be generated. At the end some open problems are presented.

[1]  Sergey Verlan,et al.  On minimal context-free insertion-deletion systems , 2005, DCFS.

[2]  A. Robinson.  I. Introduction , 1991 .

[3]  Yurii Rogozhin,et al.  Further Results on Insertion-Deletion Systems with One-Sided Contexts , 2008, LATA.

[4]  Yurii Rogozhin,et al.  One-Sided Insertion and Deletion: Traditional and P Systems Case , 2008 .

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

[6]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[7]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[8]  Gheorghe Paun,et al.  Context-free insertion-deletion systems , 2005, Theor. Comput. Sci..

[9]  Carlos Martín-Vide,et al.  Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars , 1998, Theor. Comput. Sci..

[10]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[11]  Takashi Yokomori,et al.  On the Computational Power of Insertion-Deletion Systems , 2002, DNA.

[12]  Gheorghe Paun,et al.  Marcus Contextual Grammars , 1994, Bull. EATCS.

[13]  Yurii Rogozhin,et al.  Insertion-Deletion Systems with One-Sided Contexts , 2007, MCU.

[14]  Rani Siromoney,et al.  Circular contextual insertions/deletions with applications to biomolecular computation , 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).

[15]  Solomon Marcus,et al.  Contextual Grammars , 1969, COLING.