The power of maximal parallelism in p systems

  • Authors:

  • Oscar H. Ibarra;Hsu-Chun Yen;Zhe Dang

  • Affiliations:

  • Department of Computer Science, University of California, Santa Barbara, CA;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.;School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA

  • Venue:
  • DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the following definition (different from the standard definition in the literature) of “maximal parallelism” in the application of evolution rules in a P system G: Let R ={ r1, ... rk } be the set of (distinct) rules in the system. G operates in maximal parallel mode if at each step of the computation, a maximal subset of R is applied, and at most one instance of any rule is used at every step (thus at most k rules are applicable at any step). We refer to this system as a maximally parallel system. We look at the computing power of P systems under three semantics of parallelism.