P Systems with Insertion and Deletion Exo-Operations

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 that would allow such systems to reach computational completeness. In this paper we consider insertion-deletion P systems with insertion and deletion operations applied only at the ends of string (we call them exo-operations). We show that such systems with one-symbol insertion and deletion of up to two symbols are computationally complete, and so are systems with insertion of up to two symbols and one-symbol deletion. The question about the computational power of insertion-deletion P systems with one-symbol insertion and one-symbol deletion operations applied at the ends of string is open. However, the tissue P systems reach computationally completeness even in this case.

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

[2]  Manfred Kudlek,et al.  Small Universal Circular Post Machines , 2001, Comput. Sci. J. Moldova.

[3]  Rudolf Freund,et al.  Graph-Controlled Insertion-Deletion Systems , 2010, DCFS.

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

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

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

[7]  R. Garrett,et al.  RNA Editing: The alteration of protein coding sequences of RNA : Edited by R. Benne; Ellis Horwood, Chichester, 1993. 196 pp. $ 67.95. ISBN 0-13-782558-7 , 1994 .

[8]  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).

[9]  Gheorghe Paun,et al.  At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems , 1997, DNA Based Computers.

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

[11]  Yurii Rogozhin,et al.  Computational Power of P Systems with Small Size Insertion and Deletion Rules , 2009, CSP.

[12]  Lila Kari,et al.  Contextual Insertions/Deletions and Computability , 1996, Inf. Comput..

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

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

[15]  Alexander Krassovitskiy,et al.  On the Power of Insertion P Systems of Small Size , 2009 .

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

[17]  榊原 康文,et al.  G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998) , 2000 .

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

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

[20]  Gheorghe Paun,et al.  Simulation Algorithms for Computational Systems Biology , 2017, Texts in Theoretical Computer Science. An EATCS Series.

[21]  Artiom Alhazov,et al.  P systems with minimal insertion and deletion , 2011, Theor. Comput. Sci..

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

[23]  R. Benne,et al.  RNA Editing: The Alteration of Protein Coding Sequences of RNA , 1993 .

[24]  Yurii Rogozhin,et al.  Computational power of insertion–deletion (P) systems with rules of size two , 2011, Natural Computing.

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

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