Relating randomized right-hand sides to communicating rewriting rules

Abstract

Usually, the rules are static in membrane systems. Recently, there were defined some membrane systems in which the rules are constructed dynamically. The P systems with randomized right-hand sides of rules were introduced by providing three methods to construct the rules by non-deterministically pairing left-hand and right-hand sides. In this paper, we prove that the behaviours of P systems with randomized right-hand sides of rules can be simulated by the behaviours of P systems with communicating rewriting rules with promoters. Additionally, the behaviours of P systems with communicating rewriting rules can be simulated by the behaviours of P systems with randomized right-hand sides of rules. For both these connections we talked about the complexity of the construction based on the amount of necessary resources.