Further Results on P Systems with Promoters/Inhibitors

Abstract

The paper gives several results regarding P systems with non-cooperative rules and promoters/inhibitors at the level of rules. For the class of P systems using inhibitors, generating families of sets of vectors of numbers, the equivalence with the family of Parikh sets of ET0L languages is presented. In case of P systems with non- cooperative promoted rules even if an upper bound was not given, the inclusion of the family PsET0L was proved. Moreover, a characterization of such systems by means of a particular form of random context grammars, therefore a sequential formal device, is proposed.