Formal languages
Aspects of classical language theory
Handbook of formal languages, vol. 1
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction
Membrane Computing: An Introduction
A prolog simulator for deterministic P systems with active membranes
New Generation Computing - Membrane computing
A fast P system for finding a balanced 2-partition
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Gabor wavelets and General Discriminant Analysis for face identification and verification
Image and Vision Computing
Multi-dimensional descriptional complexity of P systems
Journal of Automata, Languages and Combinatorics
A software tool for verification of Spiking Neural P Systems
Natural Computing: an international journal
Computational Complexity of Simple P Systems
Fundamenta Informaticae
Descriptional Complexity of Tissue-Like P Systems with Cell Division
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Complexity of evolution in maximum cooperative P systems
Natural Computing: an international journal
Computational Complexity of Simple P Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
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.