Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
38
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
8

Relationship

2
6

Authors

Journals

citations
Cited by 86 publications
(38 citation statements)
references
References 4 publications
0
38
0
Order By: Relevance
“…Since the three classes of generators are universal (see, for instance, [3] and [14]), this implies the universality of these three classes of acceptors. Notice, however, that the universality of the last class was already proved in [9].…”
Section: Results On Expressive Power and Encodingsmentioning
confidence: 98%
See 1 more Smart Citation
“…Since the three classes of generators are universal (see, for instance, [3] and [14]), this implies the universality of these three classes of acceptors. Notice, however, that the universality of the last class was already proved in [9].…”
Section: Results On Expressive Power and Encodingsmentioning
confidence: 98%
“…As regards acceptors, the universality of nondeterministic acceptor P systems with catalysts has been proved in [9] through simulation of register machines, and the universality of deterministic acceptors has been proved in [5] for P systems with membrane creation and dissolution, and in [5,10] for P systems with symport/antiport rules. Different notions of P systems working in generating and accepting modes have been considered, for instance in [12,15], from the point of view of complexity.…”
Section: Introductionmentioning
confidence: 99%
“…In [9] it was shown that only three catalysts are sufficient in one membrane, using only catalytic rules with the maximally parallel transition mode, to generate any recursively enumerable set of natural numbers.…”
Section: Purely Catalytic P Systemsmentioning
confidence: 99%
“…Catalytic P systems using only catalytic rules are called purely catalytic P systems. As we know from [9], only two (three) catalysts in one membrane are needed to obtain N RE with (purely) catalytic P systems without priorities working in the maximally parallel transition mode, i.e., we can write these results as follows:…”
Section: Purely Catalytic P Systemsmentioning
confidence: 99%
“…The most famous membrane computing model where determinism is a criterion of universality versus decidability is the model of catalytic P systems, see [3] and [6].…”
Section: Introductionmentioning
confidence: 99%