An introduction to parallel algorithms
An introduction to parallel algorithms
Journal of Computer and System Sciences
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Computation: finite and infinite machines
Computation: finite and infinite machines
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On the computational complexity of membrane systems
Theoretical Computer Science
On membrane hierarchy in P systems
Theoretical Computer Science
Symport/Antiport P Systems with Three Objects Are Universal
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Complexity of evolution in maximum cooperative P systems
Natural Computing: an international journal
P systems: some recent results and research problems
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Symport/Antiport P Systems with Three Objects Are Universal
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
| Hi-index | 0.00 |
We study the computational power of P system, the mathematical model of cellular membrane systems whose operations are motivated by some principles of regulated transfer of objects (molecules) through membranes and simple mutual reactions of these objects.The original model of P system describes several possible types of operations applicable to these objects, resulting in universal computational power. We show that P systems with symbol objects keep their universal computational power even if we restrict ourselves to catalyzed transport of objects through labelled membranes without their change or mutual reactions. Each transport operation is initiated by a complex of at most two objects. Moreover we do not need some other mathematical tools of P systems like priorities of operators or dissolution or creation of membranes to reach the universal computational power.In the second part of the paper we present a communicating P-system computing optimal parallel algorithm for finding maximum of a given set of integers. We therefore demonstrate that despite the simplicity of the model, it is (theoretically) capable to solve nontrivial computing tasks in a highly parallel and effective way.