Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques

Abstract

In Membrane Computing, the solution of a decision problem \(X\) belonging to the complexity class P via a polynomially uniform family of recognizer P systems is trivial, since the polynomial encoding of the input can involve the solution of the problem. The design of such solution has one membrane, two objects, two rules and one computation step. Stricto sensu, it is a solution in the framework of Membrane Computing, but it does not use Membrane Computing strategies. In this paper, we present three designs of uniform families of P systems that solve the decision problem STCON by using Membrane Computing strategies (pure Membrane Computing techniques): P systems with membrane creation, P systems with active membranes with dissolution and without polarizations and P systems with active membranes without dissolution and with polarizations. Since STCON is NL-complete, such designs are constructive proofs of the inclusion of NL in \(\mathbf{PMC}_\mathcal{MC}\), \(\mathbf{PMC}_{\mathcal{AM}^0_{+d}}\) and \(\mathbf{PMC}_{\mathcal{AM}^+_{-d}}\).