Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla
Abstract
The concept of a matter object being annihilated when meeting its corresponding
anti-matter object is taken over for rule labels as objects and anti-rule labels
as the corresponding annihilation counterpart in P systems. In the presence of a corresponding
anti-rule object, annihilation of a rule object happens before the rule that the
rule object represents, can be applied. Applying a rule consumes the corresponding rule
object, but may also produce new rule objects as well as anti-rule objects, too. Computational
completeness in this setting then can be obtained in a one-membrane P system
with non-cooperative rules and rule / anti-rule annihilation rules when using one of the
standard maximally parallel derivation modes as well as any of the maximally parallel
set derivation modes (i.e., non-extendable (multi)sets of rules, (multi)sets with maximal
number of rules, (multi)sets of rules a ecting the maximal number of objects). When
using the sequential derivation mode, at least the computational power of partially blind
register machines is obtained
