<?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%">Computing backwards with P systems </style></title><secondary-title><style face="normal" font="default" size="100%">7th Brainstorming Week 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%">02/02/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.gcn.us.es/?q=node/414</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Fénix Editora</style></publisher><pub-location><style face="normal" font="default" size="100%">Sevilla, España</style></pub-location><volume><style face="normal" font="default" size="100%">I</style></volume><pages><style face="normal" font="default" size="100%">211-226</style></pages><isbn><style face="normal" font="default" size="100%">978-84-613-2837-6</style></isbn><abstract><style face="normal" font="default" size="100%">Searching all the configurations C ′ such that produce a given configuration
C, or, in other words, computing backwards in Membrane Computing is an extremely
hard task. The current approximations are based in heavy hand-made calculus by consid-
ering the specific features of the given configuration. In this paper we present a general
method for characterizing all the configurations C ′ such that produce a given configura-
tion C in transition P systems without cooperation and without dissolution.
</style></abstract></record></records></xml>