Introducing a Space Complexity Measure for P Systems

We define space complexity classes in the framework of membrane computing, giving some initial results about their mutual relations and their connection with time complexity classes, and identifying some potentially interesting problems which require further research.

[1]  Petr Sosík.  The computational power of cell division in P systems: Beating down parallel computers? , 2004, Natural Computing.

[2]  Gheorghe Paun.  P Systems with Active Membranes: Attacking NP-Complete Problems , 2001, J. Autom. Lang. Comb..

[3]  Giancarlo Mauri,et al.  Complexity aspects of polarizationless membrane systems , 2008, Natural Computing.

[4]  Mario J. Pérez-Jiménez,et al.  Complexity classes in models of cellular computing with membranes , 2003, Natural Computing.

[5]  Giancarlo Mauri,et al.  Complexity classes for membrane systems , 2006, RAIRO Theor. Informatics Appl..

[6]  Mario J. Pérez-Jiménez,et al.  P Systems with Active Membranes, Without Polarizations and Without Dissolution: A Characterization of P , 2005, UC.

[7]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[8]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[9]  Artiom Alhazov,et al.  Uniform Solution of , 2007, MCU.

[10]  Giancarlo Mauri,et al.  Solving NP-Complete Problems Using P Systems with Active Membranes , 2000, UMC.

[11]  Andrei Paun,et al.  On P Systems with Active Membranes , 2000, UMC.

[12]  Artiom Alhazov,et al.  Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes , 2003, Fundam. Informaticae.

[13]  Mario J. Pérez-Jiménez,et al.  The P Versus NP Problem Through Cellular Computing with Membranes , 2004, Aspects of Molecular Computing.

[14]  Giancarlo Mauri,et al.  On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution , 2008, Fundam. Informaticae.