Monodirectional tissue P systems with channel states

Tissue P systems with channel states are non-deterministic bio-inspired computing devices that evolve by the interchange of objects among regions, determined by the existence of some special objects on channels called states. However, in cellular biology, the movement of molecules across a membrane is transported from high to low concentration, inspired by this biological fact, in this paper, a variant of P systems, named monodirectional tissue P systems with channel states, where communication happens between two given regions only in one direction, is considered. We show that monodirectional tissue P systems using two cells are universal if a maximal length 1 for each symport rule and any number of states or a maximal length 2 for each symport rule and 4 states are combined. Universality result is also achieved by monodirectional tissue P systems with 5 states, any number of cells and a maximal length 1 for each symport rule. Besides, computational efficiency of monodirectional tissue P systems is analyzed when cell division rules are incorporated, and a solution to the Boolean satisfiability problem (the SAT problem) is provided by such systems using a maximal length 2 for each symport rule.