P systems working in the sequential mode on arrays and strings

  • Authors:

  • Rudolf Freund

  • Affiliations:

  • Faculty of Informatics, Vienna University of Technology, Wien, Austria

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Based on a quite general definition of P systems where the rules are applied in a sequential way (and not in the maximally parallel way as it usually happens in most models of P systems considered so far in the literature), we investigate the generative power of various models of such P systems working in the sequential mode on arrays and strings, respectively. P systems working in the sequential mode on arrays/strings without priority relations for the rules reveal the same computational power as the corresponding matrix grammars without appearance checking working on arrays/strings. For obtaining the computational power of matrix grammars with appearance checking, priority relations for the rules (as one of many other possible additional features) are needed.