Petri net algorithms in the theory of matrix grammars
Acta Informatica
Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving NP-Complete Problems Using P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Computing with Membranes: P Systems with Worm-Objects
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Membrane Computing with External Output
Membrane Computing with External Output
Mobile Ambients and P-Systems
Gemmating P systems: collapsing hierarchies
Theoretical Computer Science
P Systems with Mobile Membranes
Natural Computing: an international journal
Communication via Mobile Vesicles in Brane Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
A Biologically Inspired Model with Fusion and Clonation of Membranes
UC '08 Proceedings of the 7th international conference on Unconventional Computing
On the verification of membrane systems with dynamic structure
Natural Computing: an international journal
Upper and lower bounds for the computational power of p systems with mobile membranes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Reducing the size of extended gemmating p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Tuning p systems for solving the broadcasting problem
WMC'09 Proceedings of the 10th international conference on Membrane Computing
The power of mobility: four membranes suffice
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
P systems are computational models inspired by some biological features of the structure and the functioning of real cells. In this paper we introduce a new kind of communication between membranes, based upon the natural budding of vesicles in a cell. We define the operations of gemmation and fusion of mobile membranes, and we use membrane structures and rules over strings of biological inspiration only. We prove that P systems of this type can generate all recursively enumerable languages and, moreover, the Hamiltonian Path Problem can be solved in a quadratic time. Some open problems are also formulated.