3 research outputs found
P Systems with Randomized Right-hand Sides of Rules
P systems are a model of hierarchically compartmentalized multiset rewriting.
We introduce a novel kind of P systems in which rules are dynamically constructed
in each step by non-deterministic pairing of left-hand and right-hand sides. We de ne
three variants of right-hand side randomization and compare each of them with the power
of conventional P systems. It turns out that all three variants enable non-cooperative P
systems to generate exponential (and thus non-semi-linear) number languages. We also
give a binary normal form for one of the variants of P systems with randomized rule
right-hand sides. Finally, we also discuss extensions of the three variants to tissue P
systems, i.e., P systems on an arbitrary graph structure
One-Membrane P Systems with Activation and Blocking of Rules
We introduce new possibilities to control the application of rules based on
the preceding applications, which can be de ned in a general way for (hierarchical) P
systems and the main known derivation modes. Computational completeness can be
obtained even for one-membrane P systems with non-cooperative rules and using both
activation and blocking of rules, especially for the set modes of derivation.
When we allow the application of rules to in
uence the application of rules in previous
derivation steps, applying a non-conservative semantics for what we consider to be a
derivation step, we can even \go beyond Turing"
P systems with randomized right-hand sides of rules
International audienceP systems are a model of distributed and compartmentalized multiset rewriting, complete with various signal transmission mechanisms. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We define three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides. Finally, we also discuss extensions of the three variants to tissue P systems, i.e., P systems on an arbitrary graph structure