<?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%">Daniel Díaz-Pernil</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Álvaro Romero-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Efficient simulation of tissue-like P systems by transition cell-like P systems</style></title><secondary-title><style face="normal" font="default" size="100%">Natural Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s11047-008-9102-z</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, Netherlands</style></pub-location><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">797-806</style></pages><abstract><style face="normal" font="default" size="100%">In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create an exponential number of membranes in polynomial time. Working with P systems whose membrane structure does not increase in size, it is known that it is not possible to solve computationally hard problems (unless P = NP), basically due to the impossibility of constructing exponential number of membranes, in polynomial time, using only evolution, communication and dissolution rules. In this paper we show how a family of recognizer tissue P systems with symport/antiport rules which solves a decision problem can be efficiently simulated by a family of basic recognizer P systems solving the same problem. This simulation allows us to transfer the result about the limitations in computational power, from the model of basic cell-like P systems to this kind of tissue-like P systems.</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record></records></xml>