Generalized P-Systems

We consider a variant of P-systems, a new model for computations using membrane structures and recently introduced by Gheorghe Păun. Using the membranes as a kind of filter for specific objects when transferring them into an inner compartment turns out to be a very powerful mechanism in combination with suitable rules to be applied within the membranes. The model of generalized P-systems, GP-systems for short, considered in this paper allows for the simulation of graph controlled grammars of arbitrary type based on productions working on single objects; for example, the general results we establish in this paper can immediately be applied to the graph controlled versions of context-free string grammars, n-dimensional #-context-free array grammars, and elementary graph grammars.

[1]  Gheorghe Paun,et al.  Computing with Membranes: An Introduction , 1999, Bull. EATCS.

[2]  Gheorghe Paun,et al.  Membrane Computing with External Output , 2000, Fundam. Informaticae.

[3]  Gheorghe Păun,et al.  Mathematical Aspects of Natural and Formal Languages , 1994, World scientific series in computer science.

[4]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[5]  Rudolf Freund,et al.  Attributed Elementarz Programmed Graph Grammars , 1991, WG.

[6]  Rudolf Freund Control Mechanisms on #-Context-Free Array Grammars , 1994, Mathematical Aspects of Natural and Formal Languages.

[7]  Ion Petre,et al.  A Normal form for P-Systems , 1999, Bull. EATCS.

[8]  Gheorghe Paun,et al.  On the Power of Membrane Computing , 1999, J. Univers. Comput. Sci..

[9]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[10]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..