P systems with randomized right-hand sides of rules

Artiom Alhazov (1, 2) , Rudolf Freund (3) , Sergiu Ivanov (4)

1 Institute of Mathematics [Moldova]
2 Key Laboratory of Image Information Processing, and Intelligent Contro
3 Institut für Computersprachen
4 IBISC - Informatique, BioInformatique, Systèmes Complexes

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.

Keywords: Randomized rules; P system; Tissue P system

Domains: Logic in Computer Science [cs.LO]; Symbolic Computation [cs.SC]

Artiom Alhazov, Rudolf Freund, Sergiu Ivanov. P systems with randomized right-hand sides of rules. Theoretical Computer Science, 2020, 805, pp.144--160. ⟨10.1016/j.tcs.2018.07.016⟩. ⟨hal-01879398⟩