<?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%">Miguel A. Gutiérrez-Naranjo</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%">Agustín Riscos-Núñez</style></author><author><style face="normal" font="default" size="100%">Francisco J. Romero-Campero</style></author><author><style face="normal" font="default" size="100%">Álvaro Romero-Jiménez</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">K. G. Subramanian</style></author><author><style face="normal" font="default" size="100%">K. Rangarajan</style></author><author><style face="normal" font="default" size="100%">M. Mukund</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Characterizing Tractability by Cell-Like Membrane Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Formal models, languages and applications</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Series in Machine Perception and Artificial Intelligence</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.worldscibooks.com/compsci/6180.html</style></url></web-urls></urls><section><style face="normal" font="default" size="100%">9</style></section><publisher><style face="normal" font="default" size="100%">World Scientific Publishing Company</style></publisher><pub-location><style face="normal" font="default" size="100%">Singapore</style></pub-location><volume><style face="normal" font="default" size="100%">66</style></volume><pages><style face="normal" font="default" size="100%">137-154</style></pages><isbn><style face="normal" font="default" size="100%">978-981-256-889-2</style></isbn><abstract><style face="normal" font="default" size="100%">In this paper we present a polynomial complexity class in the framework
of membrane computing. In this context, and using accepting transition
P systems, we provide a characterization of the standard computational
class P of problems solvable in polynomial time by deterministic Turing
machines.</style></abstract></record></records></xml>