Abstract
On this tenth anniversary of the Workshop on Membrane Computing, it seems appropriate and fitting to look back at some early basic contributions in the area. We give a brief summary of results, some of which answered fundamental open questions in the field. These concern complexity issues such as universality versus non-universality, determinism versus nondeterminism, various notions of parallelism, membrane and alphabet-size hierarchies, and characterizations of some classes of P systems.
This research was supported in part by NSF Grant CCF-0524136.
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
Calude, C.S., Păun, G.: Computing with Cells and Atoms: After Five Years. Taylor and Francis, London (2001); Pushchino Publishing House (2004)
Freund, R.: Special variants of P systems inducing an infinite hierarchy with respect to the number of membranes. Bulletin of the EATCS (75), 209–219 (2001)
Freund, R., Păun, Gh.: On deterministic P systems (2003), http://ppage.psystems.eu
Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science 330(2), 251–266 (2005)
Ibarra, O.H.: On membrane hierarchy in P systems. Theor. Comput. Sci. 334(1-3), 115–129 (2005)
Ibarra, O.H.: On determinism versus nondeterminism in P systems. Theoretical Computer Science 344(2-3), 120–133 (2005)
Ibarra, O.H., Păun, G.: Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems. Theor. Comput. Sci. 358(1), 88–103 (2006)
Ibarra, O.H., Woodworth, S.: On bounded symport/antiport P systems. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 129–143. Springer, Heidelberg (2006)
Ibarra, O.H., Yen, H.-C.: Deterministic catalytic systems are not universal. Theor. Comput. Sci. 363(2), 149–161 (2006)
Ibarra, O.H., Yen, H.-C., Dang, Z.: On various notions of parallelism in P Systems. Int. J. Found. Comput. Sci. 16(4), 683–705 (2005)
Krishna, S.: Infinite hierarchies on some variants of P systems (2002) (submitted); See also Languages of P systems: computability and complexity, PhD thesis, Indian Institute of Technology Madras, India (2001)
Păun, A., Păun, Gh.: The power of communication: P systems with symport/antiport. New Generation Computing 20(3), 295–306 (2002)
Păun, Gh.: Computing with membranes. Turku University Computer Science Research Report No. 208 (1998)
Păun, Gh.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)
Păun, Gh.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)
Păun, Gh.: Further twenty six open problems in membrane computing. In: Written for the Third Brainstorming Week on Membrane Computing, Sevilla, Spain (February 2005), P Systems Web Page, http://ppage.psystems.eu
Sosik, P.: P systems versus register machines: two universality proofs. In: Pre-Proceedings of the 2nd Workshop on Membrane Computing (WMC-CdeA 2002), Curtea de Arges, Romania, pp. 371–382 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H. (2010). A Look Back at Some Early Results in Membrane Computing. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2009. Lecture Notes in Computer Science, vol 5957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11467-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-11467-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11466-3
Online ISBN: 978-3-642-11467-0
eBook Packages: Computer ScienceComputer Science (R0)