A Survey of Some Variants of P Systems

Authors:
Mutyam Madhu;Kamala Krithivasan
Affiliations:
-;-
Venue:
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Year:
2002

Citing 8
Cited 1

Computing with membranes

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

Journal of Automata, Languages and Combinatorics
Marcus Contextual Grammars

Marcus Contextual Grammars
On the power of P Systems with contextual rules

Fundamenta Informaticae - Membrane computing
Contextual P Systems

Fundamenta Informaticae - Membrane computing
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

Rewriting P systems: improved hierarchies

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give a brief survey of some variants of P systems and their computational capacity. An improvement of a known result about rewriting P systems with leftmost derivation is given. We also give the generalized definition for normal forms of rewriting P systems.