Petri net algorithms in the theory of matrix grammars
Acta Informatica
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Computing with Membranes
On the Power of Membrane Computing
On the Power of Membrane Computing
Membrane Computing with External Output
Membrane Computing with External Output
Theoretical Computer Science - Natural computing
Multiset Processing by Means of Systems of Finite State Transducers
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
P Systems without Priorities Are Computationally Universal
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computing with Membranes (P Systems): Universality Results
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Two Normal Forms for Rewriting P Systems
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Theoretical Computer Science
Processes of membrane systems with promoters and inhibitors
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
A Petri net model for membrane systems with dynamic structure
Natural Computing: an international journal
Synchrony and asynchrony in membrane systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Trading polarization for bi-stable catalysts in p systems with active membranes
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Membrane Computing with External Output
Fundamenta Informaticae
| Hi-index | 0.00 |
The P systems were recently introduced as distributed parallel computing models of a biochemical type. Multisets of objects are placed in a hierarchical structure of membranes and they evolve according to given rules, which are applied in a synchronous manner: at each step, all objects which can evolve, from all membranes, must evolve. We consider here the case when this restriction is removed. As expected, unsynchronized systems (even using catalysts) are weaker than the synchronized ones, providing that no priority relation among rules is considered. The power of P systems is not diminished when a priority is used and, moreover, the catalysts can change their states, among two possible states for each catalyst.