P systems with active membranes, without polarizations and without dissolution: a characterization of P

Authors:
Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Agustín Riscos-Núñez;Francisco J. Romero-Campero
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Year:
2005

Citing 8
Cited 4

Computing with membranes

Journal of Computer and System Sciences
Evolutionary Algorithms: The Role of Mutation and Recombination

Evolutionary Algorithms: The Role of Mutation and Recombination
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The power of communication: P systems with symport/antiport

New Generation Computing
Computing with Membranes: Attacking NP-Complete Problems

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
The computational power of cell division in P systems: Beating down parallel computers?

Natural Computing: an international journal
A fast P system for finding a balanced 2-partition

Soft Computing - A Fusion of Foundations, Methodologies and Applications
An approach to computational complexity in membrane computing

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Efficient computation in rational-valued p systems

Mathematical Structures in Computer Science
Uniform solution of QSAT using polarizationless active membranes

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Computational complexity aspects in membrane computing

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
An efficient simulation of polynomial-space turing machines by p systems with active membranes

WMC'09 Proceedings of the 10th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the computational efficiency of recognizer P systems with active membranes without polarizations and without dissolution. The main result of the paper is the following: the polynomial computational complexity class associated with the class of recognizer P systems is equal to the standard complexity class P.