Two Normal Forms for Rewriting P Systems

Authors:
Claudio Zandron;Claudio Ferretti;Giancarlo Mauri
Affiliations:
-;-;-
Venue:
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Year:
2001

Citing 6
Cited 2

Petri net algorithms in the theory of matrix grammars

Acta Informatica
Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Membrane Computing with External Output

Membrane Computing with External Output
On Synchronization in P Systems

Fundamenta Informaticae

Dynamic P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P systems with memory

WMC'05 Proceedings of the 6th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

P systems have been recently introduced by Gh. Paun as a newmo del for molecular computations based on the notion of membrane structure. In this work, we consider Rewriting P Systems which use electrical charges to move objects between the membranes. We show that electrical charges, a feature introduced in order to obtain more "realistic" systems, induces simple systems: we define two normal forms for two variants of Rewriting P Systems which make use of electrical charges.