Selected papers of the Second Workshop on Concurrency and compositionality
Control mechanisms on #-context-free array grammars
Mathematical aspects of natural and formal languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Attributed Elementarz Programmed Graph Grammars
WG '91 Proceedings of the 17th International Workshop
On the Power of Membrane Computing
On the Power of Membrane Computing
Membrane Computing with External Output
Membrane Computing with External Output
Membrane Computing: When Communication Is Enough
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
String Rewriting Sequential P-Systems and Regulated Rewriting
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Molecular Computing with Generalized Homogeneous P-Systems
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Computing with Membranes (P Systems): Universality Results
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
CMC'10 Proceedings of the 11th international conference on Membrane computing
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
GP Systems with Forbidding Context
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Membrane Computing with External Output
Fundamenta Informaticae
| Hi-index | 0.00 |
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.