A Look Back at Some Early Results in Membrane Computing
- 369 Downloads
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.
KeywordsCatalytic System Regular Language Input Alphabet Deterministic Version Membrane Computing
Unable to display preview. Download preview PDF.
- 1.Calude, C.S., Păun, G.: Computing with Cells and Atoms: After Five Years. Taylor and Francis, London (2001); Pushchino Publishing House (2004)Google Scholar
- 2.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)Google Scholar
- 3.Freund, R., Păun, Gh.: On deterministic P systems (2003), http://ppage.psystems.eu
- 11.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)Google Scholar
- 13.Păun, Gh.: Computing with membranes. Turku University Computer Science Research Report No. 208 (1998)Google Scholar
- 16.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
- 17.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)Google Scholar