Abstract
P systems, introduced by Gh. Păun form a new class of distributed computing model. Several variants of Psystems were already shown to be computationally universal. In this paper, we propose a new variant of Psystems, P systems with membrane creation, in which some objects are productive and create membranes. This new variant of Psystems is capable of solving the Hamiltonian Path Problem in linear time. We show that Psystems with membrane creation are computationally complete.
This research work was supported by IBM-India Research Laboratory, India.
Acknowledgement
The authors wish to thank Prof. Gheorghe P.aun for his comments and suggestions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
http://scidiv.bcc.ctc.edu/rkr/biology101/lectures/membranes.html
Dassow, J., Păun, Gh.,: On the Power of Membrane Computing. Journal of Universal Computer Science, Vol. 5 (1999) 33–49.
Dassow, J., Păun. Gh.,: Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, (1989).
Freund, R., Păun, Gh.,: On the number of nonterminals in graph-controlled, programmed, and matrix grammars. This volume.
Ito, M., Martin-Vide, C., and Păun, Gh.,: A characterization of Parikh sets of ET0L languages interms of Psystems, submitted (2000).
Krishna, S.N., Rama, R.,: On Simple PSystems with External Output. submitted (2000).
Krishna, S.N.,: Computing with Simple Psystems. Workshop on Multiset Processing (2000).
Krishna, S.N., Rama, R.,: A variant of Psystems with Active Membranes: Solving NP-Complete Problems. Romanian Journal of Information Science and Technology, vol. 2 (1999) 357–367.
Păun, Gh.,: Six nonterminals are enough for generating each r.e. language by a matrix grammar, Intern. J. Computer Math., Vol. 15 (1984), 23–37.
Păun, Gh.,: Psystems with Active Membranes: Attacking NP-Complete problems. Journal of Automata, Languages and Combinatorics, 6, 1 (2001).
Păun, Gh.,: Computing with Membranes. Journal of Computer and System Sciences. Vol. 61 (2000) 108–143.
Păun, Gh.,: Computing with Membranes (Psystems): Twenty six Research topics. Technical Report, Auckland University (2000).
Rozenberg, G., Salomaa, A.,: Handbook of Formal Languages. Springer-Verlag, Berlin (1997).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mutyam, M., Krithivasan, K. (2001). P Systems with Membrane Creation: Universality and Efficiency. In: Margenstern, M., Rogozhin, Y. (eds) Machines, Computations, and Universality. MCU 2001. Lecture Notes in Computer Science, vol 2055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45132-3_19
Download citation
DOI: https://doi.org/10.1007/3-540-45132-3_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42121-4
Online ISBN: 978-3-540-45132-7
eBook Packages: Springer Book Archive