%0 Generic
%D 2005
%T On descriptive complexity in P systems
%A Miguel A. Gutiérrez-Naranjo
%A Mario J. Pérez-Jiménez
%A Agustín Riscos-Núñez
%C Amsterdam, The Netherlands
%I Springer
%P 320-330
%U http://www.springerlink.com/content/gvux7wbg16y3m6jg/?p=aec382c195614ca0a11739e4c1e790d8&pi=19
%V 3365
%X In this paper we address the problem of describing the complexity of the evolution of a P system. This issue is is specially hard in the case of P systems with active membranes, where the number of steps of a computation is not sufficient to evaluate the complexity. Sevilla carpets were introduced in [1], and they describe the space-time complexity of P systems. Based on them, we define some new parameters which can be used to compare evolutions of P systems. To illustrate this, we also include two different cellular solutions to the Subset Sum problem and compare them via these new parameters.
%@ 978-3-540-25080-7