P systems with randomized right-hand sides of rules

Abstract

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 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.

Parallel Multiset Rewriting Systems with Distorted Rules

“…Yet another approach to model uncertainty was to dynamically construct rules at each step during the computation. In this respect we refer the reader to [7]. Designing a robust system usually means developing a self-stabilizing computation which is able to "recover" from a specified "fault" by being able to detect the "error" and drive towards an error-free state (possibly, starting over).…”