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
Universality Results for Some Variants of P Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Towards a Hierarchy of Conformons-P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
A Survey of Some Variants of P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
A software tool for generating graphics by means of P systems
Natural Computing: an international journal
Graphical modeling of higher plants using p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
On sequential and 1-deterministic p systems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An approach to computational complexity in membrane computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'09 Proceedings of the 10th international conference on Membrane Computing
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 Direct Construction of a Universal P System
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
| Hi-index | 0.00 |
P systems, introduced by Gh. Paun form a new class of distributed computing model. Several variants of P systems were already shown to be computationally universal. In this paper, we propose a new variant of P systems, P systems with membrane creation, in which some objects are productive and create membranes. This new variant of P systems is capable of solving the Hamiltonian Path Problem in linear time. We show that P systems with membrane creation are computationally complete.