On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution

Authors:
Claudio Zandron;Alberto Leporati;Claudio Ferretti;Giancarlo Mauri;Mario J. Pérez-Jiménez
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. {zandron,leporati,ferretti,mauri}@disco.unimib. ...;(Correspd.) Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. {zandron,leporati,ferretti,mauri}@d ...;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. {zandron,leporati,ferretti,mauri}@disco.unimib. ...;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336/14, 20126 Milano, Italy. {zandron,leporati,ferretti,mauri}@disco.unimib. ...;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla, Spain. marper@us.es
Venue:
Fundamenta Informaticae
Year:
2008

Citing 11
Cited 5

Computing with membranes

Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction

Membrane Computing: An Introduction
A guide to membrane computing

Theoretical Computer Science - Natural computing
Solving NP-Complete Problems Using P Systems with Active Membranes

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
On the power of dissolution in p systems with active membranes

WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the efficiency of p systems with active membranes and two polarizations

WMC'04 Proceedings of the 5th international conference on Membrane Computing
Attacking the common algorithmic problem by recognizer p systems

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Complexity aspects of polarizationless membrane systems

Natural Computing: an international journal
Selected topics in computational complexity of membrane systems

Computation, cooperation, and life
A Σ2P∪ Π2Plower bound using mobile membranes

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
A computational complexity theory in membrane computing

WMC'09 Proceedings of the 10th international conference on Membrane Computing
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

Starting from a compositional operational semantics of transition P Systems we have previously defined, we face the problem of developing an axiomatization that is sound and complete with respect to some behavioural equivalence. To achieve this goal, ...