P systems with minimal left and right insertion and deletion

  • Authors:
  • Rudolf Freund;Yurii Rogozhin;Sergey Verlan

  • Affiliations:
  • Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău, Moldova;LACL, Département Informatique, Université Paris Est, Créteil, France

  • Venue:
  • UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article we investigate the operations of insertion and deletion performed at the ends of a string. We show that using these operations in a P systems framework (which corresponds to using specific variants of graph control), computational completeness can even be achieved with the operations of left and right insertion and deletion of only one symbol.