Abstract
Symport and antiport are biological ways for transporting molecules through membranes in a “collaborating” manner; in the case of symport several molecules pass in the same direction, in the case of antiport two or more molecules pass in opposite directions. In this paper we first survey the results on the computing power of membrane systems (P systems) using only symport/antiport rules and then improve some of the results known so far. A recent variant of P systems with purely communicating rules introduced in [24] with the name of communicating P systems is revisited and optimal (with respect to the number of membranes) universality results for that particular variant are obtained, too.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Alberts, B., et al.: Essential Cell Biology. An Introduction to the Molecular Biology of the Cell. Garland Publ. Inc., New York, London (1998)
Calude, C. S., Păun, Gh.: Computing with Cells and Atoms. Taylor & Francis, London (2001)
Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer-Verlag, Berlin (1989)
Freund, R., Oswald, M.: GP Systems with Forbidding Context. Fundamenta Informaticae 49, 1–3 (2002) 81–102
Freund, R., Oswald, M.: P Systems with Activated/Prohibited Membrane Channels, this volume
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 and Computations, 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: [21] 237–248
Martin-Vide, C., Păun, A., Păun, Gh.: On the Power of P Systems with Symport Rules. J. Universal Computer Sci. 8 2 (2002) 317–331
Martin-Vide, C., Păun, A., Păun, Gh., Rozenberg, G.: Membrane Systems with Coupled Transport: Universality and Normal Forms. Fundamenta Informaticae 49, 1–3 (2002) 1–15
Martin-Vide, C., Păun, Gh.: Elements of Formal Language Theory for Membrane Computing. Technical Report 21/01 of the Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona (2001)
Minsky, M. L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey (1967)
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, A., Păun, Gh., Rodriguez-Paton, A.: Further Remarks on P Systems with Symport Rules. Ann. Univ. Al.I. Cuza, Iaşi 10 (2001) 3–18
Păun, A., Păun, Gh., Rozenberg, G.: Computing by Communication in Networks of Membranes. International Journal of Foundations of Computer Science (2002) accepted
Păun, Gh.: Computing with Membranes. Journal of Computer and System 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, Gh., Perez-Jimenez, M., Sancho-Caparrini, F.: On the Reachability Problem for P Systems with Symport/Antiport. 10th Intern. Conf. on Automata and Formal Languages, Debrecen, 2002
Păun, Gh., Zandron, C. (eds.): Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Argeş, Romania (2002)
Salomaa, A., Rozenberg, G. (eds.): Handbook of Formal Languages. Springer-Verlag, Berlin (1997)
Sosík, P.: P Systems Versus Register Machines: Two Universality Proofs. In: [21] 371–382
Sosík, P., Matysek, J.: Membrane Computing: When Communication is Enough. In: Calude, C. S., Dinneen, M. J., Peper, F. (eds.): Unconventional Models of Computation 2002, LNCS 2509, Springer-Verlag, Berlin (2002) 264–275
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., PĂun, A. (2003). Membrane Systems with Symport/Antiport Rules: Universality Results. 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_18
Download citation
DOI: https://doi.org/10.1007/3-540-36490-0_18
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