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.
CITATION STYLE
Alhazov, A., Freund, R., & Ivanov, S. (2018). Hierarchical P systems with randomized right-hand sides of rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10725 LNCS, pp. 15–39). Springer Verlag. https://doi.org/10.1007/978-3-319-73359-3_2
Mendeley helps you to discover research relevant for your work.