A Characterisation of NL Using Membrane Systems without Charges and Dissolution

  • Authors:

  • Niall Murphy;Damien Woods

  • Affiliations:

  • Department of Computer Science, National University of Ireland, Maynooth, Ireland;Department of Computer Science and Artificial Intelligence, University of Seville, Seville, Spain

  • Venue:
  • UC '08 Proceedings of the 7th international conference on Unconventional Computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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 AC0and 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 Pto 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 Pare shown to retain their computational power under the new uniformity conditions. Similarly, a number of membrane systems that are lower bounded by PSPACEretain their power under the new uniformity conditions.