Membrane systems (with symbol objects) are distributed controlled multiset
processing systems. Non-cooperative P systems with either promoters or inhibitors (of
weight not restricted to one) are known to be computationally complete. Since recently,
it is known that the power of the deterministic subclass of such systems is subregular. We
present new results on the weight of promoters and inhibitors, as well as for characterizing
the systems with priorities only