Journal of Computer and System Sciences
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
From regulated rewriting to computing with membranes: collapsing hierarchies
Theoretical Computer Science
Tissue P systems with channel states
Theoretical Computer Science - Insightful theory
Computation: finite and infinite machines
Computation: finite and infinite machines
P systems with conditional communication rules assigned to membranes
Journal of Automata, Languages and Combinatorics
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Three "quantum" algorithms to solve 3-SAT
Theoretical Computer Science
Energy-Based models of p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Hi-index | 0.00 |
We introduce a new variant of membrane systems where the rules are directly assigned to membranes and, moreover, every membrane carries an energy value that can be changed during a computation by objects passing through the membrane. The result of a successful computation is considered to be the distribution of energy values carried by the membranes. We show that for systems working in the sequential mode with a kind of priority relation on the rules we already obtain universal computational power. When omitting the priority relation, we obtain a characterization of the family of Parikh sets of languages generated by context-free matrix grammars. On the other hand, when using the maximally parallel mode, we do not need a priority relation to obtain computational completeness. Finally, we introduce the corresponding model of tissue P systems with energy assigned to the membrane of each cell and objects moving from one cell to another one in the environment as well as being able to change the energy of a cell when entering or leaving the cell. In each derivation step, only one object may pass through the membrane of each cell. When using priorities on the rules in the sequential mode (where in each derivation step only one cell is affected) as well as without priorities in the maximally parallel mode (where in each derivation step all cells possible are affected) we again obtain computational completeness, whereas without priorities on the rules in the sequential mode we only get a characterization of the family of Parikh sets of languages generated by context-free matrix grammars.