<?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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Searching previous configurations in membrane computing</style></title><secondary-title><style face="normal" font="default" size="100%">10th Workshop on Membrane 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%">24-27/08/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.gcn.us.es/?q=procwmc10</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Marpapublicidad</style></publisher><pub-location><style face="normal" font="default" size="100%">Curtea de Arges, Rumania</style></pub-location><pages><style face="normal" font="default" size="100%">282-297</style></pages><abstract><style face="normal" font="default" size="100%">Searching all the configurations C' which produce a given configuration C
is an extremely hard task. The current approximations are based on heavy hand-made
calculus by considering the specic features of the given conguration. In this paper we
present a general method for characterizing all the configurations C' which produce a
given conguration C in the framework of transition P systems without cooperation and
without dissolution.</style></abstract></record></records></xml>