Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Natural computing
The power of communication: P systems with symport/antiport
New Generation Computing
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computing with Membranes
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
On membrane hierarchy in P systems
Theoretical Computer Science
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
On determinism versus nondeterminism 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
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
On bounded symport/antiport P systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
Signaling p systems and verification problems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On sequential and 1-deterministic p systems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the computational complexity of P automata
DNA'04 Proceedings of the 10th international conference on DNA computing
The power of maximal parallelism in p systems
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On deterministic catalytic systems
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Computing with cells: membrane systems-some complexity issues
International Journal of Parallel, Emergent and Distributed Systems
| Hi-index | 0.00 |
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, namely a P system, from natural phenomena of cell evolutions and chemical reactions. Because of the nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems (in much the same way as the promise of quantum and DNA computing) once future bio-technology (or silicon-technology) gives way to a practical bio-realization (or chip realization). Here we report on recent results that answer some interesting and fundamental open questions in the field. These concern computational issues such as determinism versus nondeterminism, membrane and alphabet-size hierarchies, and various notions of parallelism.