Monodirectional Tissue P Systems With Proteins on Cells

Abstract

A variant of tissue-like P systems is known as monodirectional tissue P systems, where objects only have one direction to move between two regions. In this article, a special kind of objects named proteins are added to monodirectional tissue P systems, which can control objects moving between regions, and such computational models are named as monodirectional tissue P systems with proteins on cells (PMT P systems). We discuss the computational properties of PMT P systems. In more detail, PMT P systems employing two cells, one protein controlling a rule, and at most one object used in each symport rule are capable of achievement of Turing universality. In addition, PMT P systems using one protein controlling a rule, and at most one object used in each symport rule can effectively solve the Boolean satisfiability problem (simply SAT ).