Power and efficiency of minimal parallelism in polarizationless P systems

Authors:
Tseren-Onolt Ishdopj
Affiliations:
Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain and Department of Information Technologies, Åbo Akademi University, Turku, Finland
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2006

Citing 7
Cited 1

P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
Computation: finite and infinite machines

Computation: finite and infinite machines
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
P systems with minimal parallelism

Theoretical Computer Science

P systems with active membranes operating under minimal parallelism

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be applied. In this paper, we consider the minimal parallelism for P systems with active membranes without polarizations, using additional features, such as separation operations, changing membrane labels, catalytic or cooperative rules, etc. With several combinations of such features we obtain computational completeness. In cases where membrane division (of elementary or non-elementary membranes) is allowed, we show how SAT can be solved in polynomial time.