2023 Volume 27 Issue 6 Pages 1130-1136
Lattice based communication P (LTC-P) systems are a class of extended P systems with lattice membrane structures. This new P-system is recently proposed in our work and LTC-P systems have been shown to be computational completeness. LTC-P systems can efficiently solve some kinds of combination-optimization problems. The purpose of this paper is to investigate the computation power of LTC-P systems through comparison with Chomsky families and Lindenmayer system. The formal framework of LTC-P systems is also provided. Then, we use LTC-P systems to solve SAT and HPP in linear time. Results have shown that LTC-P systems have comparative advantage in the use of membrane numbers.
This article cannot obtain the latest cited-by information.