Membrane computing and complexity theory: A characterization of PSPACE

Journal of Computer and System Sciences

Volumn 73, Issue 1, 2007, Pages 137-152

  Sosík, Petr ^a,b   Rodríguez Patón, Alfonso ^a  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b SILESIAN UNIVERSITY IN OPAVA   (Czech Republic)

Author keywords

Alternating Turing machine; Biological computation; P system; PSPACE

Indexed keywords

DATA PROCESSING; GENETIC ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; TURING MACHINES;

ALTERNATING TURING MACHINE; BIOLOGICAL COMPUTATION; P SYSTEM; PSPACE;

COMPUTATIONAL COMPLEXITY;

EID: 33750969350     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.10.001     Document Type: Article

References (19)

1. Alhazov A., Martín-Vide C., and Pan L. Solving a PSPACE-complete problem by P systems with restricted active membranes. Fund. Inform. 58 2 (2003) 67-77
2. Arora S., Rabani Y., and Vazirani U.V. Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). STOC 26 (1994), ACM 459-467
3. Beaver D. A universal molecular computer. In: Lipton R.J., and Baum E.B. (Eds). DNA Based Computers. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 27 (1995), Amer. Math. Soc. 29-36
4. G. Ciobanu, L. Pan, G. Pǎun, M.J. Pérez-Jiménez, P systems with minimal parallelism, submitted for publication
5. In: Ciobanu G., Pǎun G., and Pérez-Jiménez M.J. (Eds). Applications of Membrane Computing (2005), Springer-Verlag, Berlin
6. Dantsin E., and Wolpert A. A robust DNA computation model that captures PSPACE. Internat. J. Found. Comput. Sci. 14 5 (2003) 933-951
7. Gutiérrez-Naranjo M.A., Pérez-Jiménez M.J., Riscos-Núñez A., and Romero-Campero F.J. On the power of dissolution in P systems with active membranes. In: Freund R., et al. (Ed). Membrane Computing, 6th Int. Workshop. Lecture Notes in Comput. Sci. vol. 3850 (2006), Springer-Verlag, Berlin 224-240
8. Gutiérrez-Naranjo M.A., Pérez-Jiménez M.J., Riscos-Núñez A., Romero-Campero F.J., and Romero-Jiménez A. Characterizing tractability by cell-like membrane systems. In: Subramanian K.G., Rangarajan K., and Mukund M. (Eds). Formal Models, Languages and Applications. Ser. Mach. Percept. Artif. Intell. vol. 66 (2006), World Scientific 137-154
9. Martín-Vide C., Pǎun G., Pazos J., and Rodríguez-Patón A. Tissue P Systems. Theoret. Comput. Sci. 296 2 (2003) 295-326
10. Pǎun Gh. Computing with membranes. J. Comput. System Sci. 61 (2000) 108-143
11. Pǎun Gh. Membrane Computing: An Introduction (2002), Springer-Verlag, Berlin
12. Pǎun Gh. P systems with active membranes: Attacking NP complete problems. J. Autom. Lang. Comb. 6 1 (2001) 75-90
13. Pérez-Jiménez M.J., Jiménez A.R., and Sancho-Caparrini F. Complexity classes in models of cellular computing with membranes. Nat. Comput. 2 (2003) 265-285
14. Porreca A.E., Mauri G., and Zandron C. Complexity classes for membrane systems. RAIRO Theor. Inform. Appl. 40 (2006) 141-162
15. Pudlák P. Complexity theory and genetics: The computational power of crossing-over. Inform. and Comput. 171 (2001) 201-223
16. Sosík P. The computational power of cell division: Beating down parallel computers?. Nat. Comput. 2-3 (2003) 287-298
17. van Emde Boas P. Machine models and simulations. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science, vol. A (1990), Elsevier Science Publisher, Amsterdam 1-66
18. Zandron C., Ferretti C., and Mauri G. Solving NP-complete problems using P systems with active membranes. In: Antoniou I., Calude C.S., and Dinneen M.J. (Eds). Unconventional Models of Computation (2000), Springer-Verlag, London 289-301
19. The P Systems Web Page at. http://psystems.disco.unimib.it