Formal languages
Journal of Computer and System Sciences
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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
Computation: finite and infinite machines
Computation: finite and infinite machines
Membrane Computing with External Output
Fundamenta Informaticae
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Hi-index | 0.00 |
We consider extended variants of GP systems, i.e., membrane systems with sequential applications of evolution rules. The main features we explore are applicability conditions (context conditions) on single objects as well as on the remaining contents of the underlying compartment. For a special very restricted variant only using forbidding context conditions we already obtain universal computational power.