Solving the SAT Problem by Cell-Like P Systems with Channel States and Symport Rules

Cell-like P systems with channel states, which are a variant of tissue P systems in membrane computing, can be viewed as highly parallel computing devices based on the nested structure of cells, where communication rules are classified as symport rules and antiport rules. In this work, we remove the antiport rules and construct a novel variant, namely, cell-like P systems with channel states and symport rules, where one rule is only allowed to be nondeterministically applied once per channel. To explore the computational efficiency of the variant, we solve the SAT problem and obtain a uniform solution in polynomial time with the maximal length of rules 1. The results of our work are reflected in the following two aspects: first, communication rules are restricted to only one type, namely, symport rules; second, the maximal length of rules is decreased from 2 to 1. Our work indicates that the constructed variant with fewer rule types can still solve the SAT problem and obtain better results in terms of computational complexity. Hence, in terms of computational efficiency, our work is a notable improvement.