On the Complexity of Szilard Languages of Matrix Grammars

  • Authors:

  • Liliana Cojocaru;Erkki Makinen

  • Affiliations:

  • -;-

  • Venue:
  • SYNASC '11 Proceedings of the 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate computational resources used by alternating Turing machines (ATMs) to accept Szilard languages (SZLs) of context-free matrix grammars (MGs). The main goal is to relate these languages to parallel complexity classes such as NC1 and NC2. We prove that unrestricted and leftmost-1 SZLs of context-free MGs, without appearance checking, can be accepted by ATMs in logarithmic time and space. Hence, these classes of languages belong to NC1 (under ALOGTIME reduction). Unrestricted SZLs of context-free MGs with appearance checking can be accepted by ATMs in logarithmic space and square logarithmic time. Consequently, this class is contained in NC2. We conclude with some results on SZLs of MGs with phrase-structure rules.