Abstract
We investigate a variant of purely communicating P systems, where multisets of activators can open channels for certain objects to pass through membranes in one direction; however, the permeability of a channel can be controlledb y multisets of prohibitors, too.
We will show that for such systems with only one membrane andusing only singleton activator andprohibitor sets, we already obtain universal computational power. When using systems with activating multisets for membrane channels only, we obtain a similar result. By showing a close correspondence to P systems with symport/antiport as introduced in [13] we can optimize some results given there.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bernardini, F., Manca, V.: P Systems with Boundary Rules. In: 14 97–102
Dassow, J., Păun, Gh.: RegulatedRewriting in Formal Language Theory. Springer-Verlag, Berlin (1989)
Dassow, J., Păun, Gh.: On the power of membrane computing. Journal of Universal Computer Science 5, 2 (1999) 33–49 (http://www.iicm.edu/jucs)
Freund, R.: Sequential P systems. In: Freund, R. (ed.): Theorietag 2000, TU Wien (2000) 177–183
Freund, R., Oswald, M.: GP Systems with Forbidding Context. Fundamenta Informaticae 49, 1–3 (2002) 81–102
Freund, R., Păun, Gh.: On the Number of Non-terminals in Graph-controlled, Programmed, and Matrix Grammars. In: Margenstern, M., Rogozhin, Y. (eds.): Proc. Conf. Universal Machines andComputations, Chişinău (2001). Springer-Verlag, Berlin (2001)
Freund, R., Păun, Gh.: From Regulated Rewriting to Computing with Membranes: Collapsing Hierarchies; to appear in TCS
Frisco, P., Hoogeboom, H. J.: Simulating counter automata by P systems with symport/antiport. In: [14] 237–248
Minsky, M. L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey (1967)
Păun, Gh.: Computing with Membranes. Journal of Computer andSystem Sciences 61, 1 (2000) 108–143 and TUCS Research Report 208 (1998) (http://www.tucs.fi)
Păun, Gh.: Computing with Membranes: An Introduction. Bulletin EATCS 67 (1999) 139–152
Păun, Gh.: Membrane Computing: An Introduction. Springer-Verlag, Berlin (2002)
Păun, A., Păun, Gh.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computing 20, 3 (2002) 295–306
Păun, Gh., Zandron, C. (eds.): Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Argeş, Romania (2002)
Sosík, P.: P systems versus register machines: two universality proofs. In: [14] 371–382
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freund, R., Oswald, M. (2003). P Systems with Activated/Prohibited Membrane Channels. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-36490-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00611-4
Online ISBN: 978-3-540-36490-0
eBook Packages: Springer Book Archive