Polymorphic P Systems with Non-cooperative Rules and No Ingredients

Ivanov, Sergiu

doi:10.1007/978-3-319-14370-5_16

Cited by 5 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among further ideas on dynamic rules, one may list rule creation [4], activators [1], inhibiting/deinhibiting rules [7], and symport/antiport of rules [6]. One of the more recent developments in this direction are polymorphic P systems [2,3,12], in which rules are defined by pairs of membranes, whose contents may be modified by moving objects in or out.…”

Section: Introductionmentioning

confidence: 99%

P systems with randomized right-hand sides of rules

Alhazov

Freund

Ivanov

2020

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

P systems with randomized right-hand sides of rules

Alhazov

Freund

Ivanov

2020

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Among further ideas on dynamic rules, one may list rule creation (Arroyo et al 2002), activators (Alhazov 2004), inhibiting/deinhibiting rules , and symport/antiport of rules (Cavaliere and Genova 2004). One of the more recent developments in this direction are polymorphic P systems (Alhazov et al 2015(Alhazov et al , 2011Ivanov 2014), in which rules are defined by pairs of membranes, whose contents may be modified by moving objects in or out, as well as P systems with randomized right-hand sides of rules (Alhazov et al , 2018a, where the right-hand sides are chosen randomly and in different ways from the given set of rules.…”

Section: Introductionmentioning

confidence: 99%

Variants of P systems with activation and blocking of rules

2019

Self Cite

View full text Add to dashboard Cite

We introduce new possibilities to control the application of rules based on the preceding applications, which can be defined in a general way for (hierarchical) P systems and the main known derivation modes. Computational completeness can be obtained even with non-cooperative rules and using both activation and blocking of rules, especially for the set modes of derivation, when allowing derivation steps with no rules being applied. When we allow the application of rules to influence the application of rules in previous derivation steps, applying a non-conservative semantics for what we consider to be a valid infinite derivation, we can even ''go beyond Turing''. Keywords Activation of rules Á Blocking of rules Á Computational completeness Á Derivation modes Á P systems Á Go beyond Turing This is a revised and extended version of the paper presented at UCNC 2018 in Fontainebleau, France, see Alhazov et al. (2018d).

show abstract