A Characterisation of NL Using Membrane Systems without Charges and Dissolution

  • Niall Murphy
  • Damien Woods
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5204)

Abstract

We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like circuits, membrane systems are defined as uniform families. To date, polynomial time uniformity has been the accepted uniformity notion for membrane systems. Here, we introduce the idea of using AC0 and L-uniformities and investigate the computational power of membrane systems under these tighter conditions. It turns out that the computational power of some systems is lowered from P to NL, so it seems that our tighter uniformities are more reasonable for these systems. Interestingly, other systems that are known to be lower bounded by P are shown to retain their computational power under the new uniformity conditions. Similarly, a number of membrane systems that are lower bounded by PSPACE retain their power under the new uniformity conditions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alhazov, A., Pérez-Jiménez, M.J.: Uniform solution to QSAT using polarizationless active membranes. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 122–133. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Allender, E., Gore, V.: On strong separations from AC0. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 13, 21–37 (1993)MathSciNetGoogle Scholar
  3. 3.
    Balcázar, J.L., Diaz, J., Gabarró, J.: Structural complexity I, 2nd edn. Springer, New York (1988)MATHGoogle Scholar
  4. 4.
    Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC1. Journal of Computer and System Sciences 41(3), 274–306 (1990)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Furst, M.L., Saxe, J.B., Sipser, M.: Parity, circuits and the polynomial-time hierarchy. Theory of Computing Systems (formerly Mathematical Systems Theory) 17(1), 13–27 (1984)MATHMathSciNetGoogle Scholar
  6. 6.
    Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation:P-completeness Theory. Oxford University Press, New York (1995)MATHGoogle Scholar
  7. 7.
    Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Campero, F.J.: Computational efficiency of dissolution rules in membrane systems. International Journal of Computer Mathematics 83(7), 593–611 (2006)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Immerman, N.: Expressibility and parallel complexity. SIAM Journal on Computing 18(3), 625–638 (1989)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Karp, R.M., Ramachandran, V.: Parallel algorithms for shared memory machines. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 17, vol. A, pp. 869–941. Elsevier, Amsterdam (1990)Google Scholar
  10. 10.
    Ladner, R.E.: The circuit value problem is log space complete for P. SIGACT News 7(1), 18–20 (1975)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Murphy, N., Woods, D.: Active membrane systems without charges and using only symmetric elementary division characterise P. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 367–384. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1993)Google Scholar
  13. 13.
    Păun, G.: P Systems with active membranes: Attacking NP-Complete problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001); CDMTCS TR 102, Univ. of Auckland (1999), www.cs.auckland.ac.nz/CDMTCS MATHMathSciNetGoogle Scholar
  14. 14.
    Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)MATHGoogle Scholar
  15. 15.
    Păun, G.: Further twenty six open problems in membrane computing. In: Proceedings of the Third Brainstorming Week on Membrane Computing, Sevilla (Spain), January 31st - February 4th, pp. 249–262 (2005)Google Scholar
  16. 16.
    Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity classes in models of cellular computing with membranes. Natural Computing 2(3), 265–285 (2003)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company (1996)Google Scholar
  18. 18.
    Sosík, P., Rodríguez-Patón, A.: Membrane computing and complexity theory: A characterization of PSPACE. Journal of Computer and System Sciences 73(1), 137–152 (2007)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Niall Murphy
    • 1
  • Damien Woods
    • 2
  1. 1.Department of Computer ScienceNational University of IrelandMaynoothIreland
  2. 2.Department of Computer Science and Artificial IntelligenceUniversity of SevilleSevilleSpain

Personalised recommendations