The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
On membrane computing based on splicing
Where mathematics, computer science, linguistics and biology meet
The power of communication: P systems with symport/antiport
New Generation Computing
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Theoretical Computer Science
Fundamenta Informaticae
P Systems with Proteins on Membranes
Fundamenta Informaticae
On the Computational Power of 1-Deterministic and Sequential P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A study of the robustness of the EGFR signalling cascade using continuous membrane systems
IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I
On bounded symport/antiport P systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Symbol/Membrane complexity of p systems with symport/antiport rules
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Minimal parallelism for polarizationless p systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Some computational issues in membrane computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the computational complexity of P automata
DNA'04 Proceedings of the 10th international conference on DNA computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
P systems with proteins on membranes and membrane division
DLT'06 Proceedings of the 10th 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
Hi-index | 0.00 |
Membrane computing is a branch of natural computing which abstracts computing models from the structure and the functioning of the living cell. The main ingredients of membrane systems, called P systems, are (i) the membrane structure, which consists of a hierarchical arrangements of membranes which delimit compartments where (ii) multisets of symbols, called objects, evolve according to (iii) sets of rules which are localised and associated with compartments. By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions is a computation of how the system is evolving. Various ways of controlling the transfer of objects from one membrane to another and applying the rules, as well as possibilities to dissolve, divide or create membranes have been studied. Membrane systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems once future biotechnology gives way to a practical bio-realization. In this paper we survey some interesting and fundamental complexity issues such as universality vs. nonuniversality, determinism vs. nondeterminism, membrane and alphabet size hierarchies, characterizations of context-sensitive languages and other language classes and various notions of parallelism.