P Systems with Minimal Left and Right Insertion and Deletion

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

A Computational Complexity Theory in Membrane Computing

In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with di erent models of cell-like and tissue-like membrane systems are de ned and the most relevant results obtained so far are presented. Many attractive characterizations of P 6= NP conjecture within the framework of a bio-inspired and non-conventional computing model are deduced.Ministerio de Educación y Ciencia TIN2006-13425Junta de Andalucía P08–TIC-0420

Limits of the power of Tissue P systems with cell division

Tissue P systems generalize the membrane structure tree usual in original models of P systems to an arbitrary graph. Basic opera- tions in these systems are communication rules, enriched in some variants with cell division or cell separation. Several variants of tissue P systems were recently studied, together with the concept of uniform families of these systems. Their computational power was shown to range between P and NP ? co-NP , thus characterizing some interesting borderlines between tractability and intractability. In this paper we show that com- putational power of these uniform families in polynomial time is limited by the class PSPACE . This class characterizes the power of many clas- sical parallel computing model

About One-Sided One-Symbol Insertion-Deletion P Systems

International audienceno abstrac