<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gabriel Ciobanu</style></author><author><style face="normal" font="default" size="100%">Solomon Marcus</style></author><author><style face="normal" font="default" size="100%">Gheorghe Paun</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">New strategies of using the rules of a P system in a maximal way. Power and complexity</style></title><secondary-title><style face="normal" font="default" size="100%">Romanian Journal of Information Science and Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.imt.ro/romjist/Volum12/Number12_2/pdf/03-Ciobanu.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">EDITURA ACADEMIEI ROMÂNE</style></publisher><pub-location><style face="normal" font="default" size="100%">Bucureşti, România</style></pub-location><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">157-173</style></pages><abstract><style face="normal" font="default" size="100%">We examine the computing power and complexity of P systems
which use two strategies of applying the rules. One strategy is to maximize the
number of objects used in rules and the other is to maximize the number of rules
applied in each membrane. For P systems with cooperative multiset rewriting
rules, P systems with active membranes, and P systems with symport/antiport
rules we prove the computational universality for both these types of parallelism.
The computational complexity of the maximum consuming systems is studied for
systems with cooperative rules of two types, by using two known combinatorial
NP-complete problems, namely the knapsack problem and the integer linear
programming.</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue><custom1><style face="normal" font="default" size="100%">0.075</style></custom1><custom2><style face="normal" font="default" size="100%">56/58 - Q4</style></custom2></record></records></xml>