Titlebook: Membrane Computing; International Worksh Gheorghe PĂun,Grzegorz Rozenberg,Claudio Zandron Conference proceedings 2003 Springer-Verlag Berli

抚慰

树胶

Glucose

Self-activating P Systems, of unactivated base-membranes, which, in a polynomial time, are activated in an exponential number. Using these type of systems we solve the SAT problem in a linear time, with respect to the number of variables and clauses.

Mercurial

P Systems with Activated/Prohibited Membrane Channels,tivating multisets for membrane channels only, we obtain a similar result. By showing a close correspondence to P systems with symport/antiport as introduced in [.] we can optimize some results given there.

CYN

Membrane Systems with Symport/Antiport Rules: Universality Results,variant of P systems with purely communicating rules introduced in [.] with the name of communicating P systems is revisited and optimal (with respect to the number of membranes) universality results for that particular variant are obtained, too.

FLOUR

Eilenberg P Systems,lationshipwith three parameters: number of membranes, states and set of distributed rules. It is shown that EPP systems represent a promising framework for solving NP-complete problems. In particular linear time solutions are provided for the SAT problem.

法律的瑕疵

An Application of Dynamic P Systems: Generating Context-Free Languages,. will “compute” the language ., i.e., one of the configurations of the system will contain all words of . of length . at depth . - 1. Our approach is an attempt to prove the richness and power of the concept of dynamic P system, both in the area of P systems, and in the area of contextual grammars.

障碍

纬度

Mast-Cell