Affiliations: Dipartimento di Informatica, Sistemistica e Comunicazione, Università di Milano-Bicocca degli Studi, Viale Sarca 336, 20126 Milano, Italy. [email protected] | Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya 35, 43002 Tarragona, Spain. [email protected] | Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Academiei 5, Chişinău MD-2028, Moldova. [email protected] | Département Informatique, Université Paris Est, 61 av. Général de Gaulle, 94010 Créteil, France. [email protected]
Note: [] The author gratefully acknowledges the project RetroNet by the Lombardy Region of Italy under the ASTIL Program (regional decree 6119, 20100618). Also works: Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Academiei 5, Chişinău MD-2028 Moldova.
Note: [] The author acknowledge the support of the Spanish Ministerio de Ciencia y Tecnología, project MTM2007-63422.
Note: [] Address for correspondence: Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Academiei 5, Chişinău MD-2028, Moldova
Abstract: 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.
