Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: minimal parallelism

Sortuj według:

Ogranicz wyniki do:

Uniform Solution to Common Algorithmic Problem by P Systems Working in the Minimally Parallel Mode

Niu Y., Venkat I., Khader A. T., Subramanian K. G.

Fundamenta Informaticae

2015

Vol. 136, nr 3

285--296

It is known that the Common Algorithmic Problem (CAP) has the nice property that several other NP-complete problems can be reduced to it in linear time. The decision version of this problemis known to be efficiently solved by a family of recognizer P systems with activemembranes with three electrical charges working in the maximally parallel way. We here work with a variant of P systems with active membranes without polarizations and present a uniform solution to CAP in the minimally parallel mode.

Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions

Alhazov A., Oswald M., Freund R., Verlan S.

Fundamenta Informaticae

2009

Vol. 91, nr 1

17-34

We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable anymore at the same time, whereas usually a computation is called halting if no rule is applicable anymore in the whole system. This new variant of partial halting is especially investigated for several variants of P systems using membrane rules with permitting contexts and working in different transition modes, especially for minimal parallelism. Both partial halting and minimal parallelism are based on an arbitrary set of subsets from the set of rules assigned to the membranes.