A Polynomial Complexity Class in P Systems Using Membrane Division

In this paper we introduce the complexity class PMCF of all decision problems solvable in polynomial time by a family of P systems belonging to a given class of membrane systems with input, F. We show that the problem of determining if a boolean formula in conjunctive normal form is satisfiable belongs to PMCAM, where AM is the class of recognizer P systems with input and with active membranes using 2-division. We conclude that the class NP is contained in the above mentioned complexity class.