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.
Unable to display preview. Download preview PDF.
- 2.J. Dassow and Gh. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989).Google Scholar
- 3.J. Dassow and Gh. Păun, On the power of membrane computing, TUCS Research Report No. 217 (Dec. 1998).Google Scholar
- 4.R. Freund and B. Haberstroh, Attributed elementary programmed graph grammars, Proceedings 17th International Workshop on Graph-Theoretic Concepts in Computer Science (LNCS 570, Springer-Verlag, 1991), pp. 75–84.Google Scholar
- 5.R. Freund, Control mechanisms on #-context-free array grammars, Mathematical Aspects of Natural and Formal Languages (Gh. Păun, ed.), World Scientific, Singapore (1994), pp. 97–137.Google Scholar
- 6.Gh. Păun, Computing with membranes, TUCS Research Report No. 208 (Nov. 1998).Google Scholar
- 7.Gh. Păun, Computing with membranes: an introduction, Bulletin EATCS 67 (Febr. 1999), pp. 139–152.Google Scholar
- 9.Gh. Păun, G. Rozenberg, and A. Salomaa, Membrane computing with external output, TUCS Research Report No. 218 (Dec. 1998).Google Scholar
- 10.I. Petre, A normal form for P-systems, Bulletin EATCS 67 (Febr. 1999), pp. 165–172.Google Scholar