A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division

Cell-like P systems with channel states and symport/antiport rules are distributed parallel computing devices, where a state associated with each channel is used to control communication between neighboring regions. In this work, membrane division is introduced into cell-like P systems with channel states and symport/antiport rules, and we call this variant of cell-like P systems as symport/antiport P systems with channel states and membrane division. The computational efficiency of such kind of P systems is investigated. We provide a uniform solution to the SAT problem by cell-like P systems with channel states using membrane division and symport/antiport rules of length at most 2, where the P system can solve all instances of the problem with the same size.