P systems with randomized right-hand sides of rules

Abstract : P 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.
Document type :
Journal articles
Complete list of metadatas

Contributor : Frédéric Davesne <>
Submitted on : Sunday, September 23, 2018 - 6:07:55 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM



Artiom Alhazov, Rudolf Freund, Sergiu Ivanov. P systems with randomized right-hand sides of rules. Theoretical Computer Science, Elsevier, In press, ⟨10.1016/j.tcs.2018.07.016⟩. ⟨hal-01879398⟩



Record views