Universality Results for Some Variants of P Systems

Authors:
Madhu Mutyam;Kamala Krithivasan
Affiliations:
-;-
Venue:
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Year:
2000

Citing 5
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Computing with Membranes: Attacking NP-Complete Problems

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
P Systems with Membrane Creation: Universality and Efficiency

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality

Quantified Score

Hi-index	0.01

Visualization

Abstract

P systems, introduced by Gh. P驴un, form a new class of distributed computing models. Many variants of P systems were shown to be computationally universal. In this paper, we consider several classes of P systems with symbol-objects where we allow the catalysts to move in and out of a membrane. We prove universality results for these variants of P systems with a very small number of membranes.