Chapter

Theoretical Aspects of Computing – ICTAC 2011

Volume 6916 of the series Lecture Notes in Computer Science pp 77-94

On the Complexity of Szilard Languages of Regulated Grammars

  • Liliana CojocaruAffiliated withSchool of Information Sciences, Computer Science, University of Tampere
  • , Erkki MäkinenAffiliated withSchool of Information Sciences, Computer Science, University of Tampere

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We investigate computational resources used by alternating Turing machines (ATMs) to accept Szilard languages (SZLs) of regulated rewriting grammars. The main goal is to relate these languages to low-level complexity classes such as \(\cal N\) \(\cal C\) 1 and \(\cal N\) \(\cal C\) 2. We focus on the derivation process in random context grammars (RCGs) with context-free rules. We prove that unrestricted SZLs and leftmost-1 SZLs of RCGs can be accepted by ATMs in logarithmic time and space. Hence, these languages belong to the \(U_{E^*}\)-uniform \(\cal N\) \(\cal C\) 1 class. Leftmost-i SZLs, i ∈ {2,3}, of RCGs can be accepted by ATMs in logarithmic space and square logarithmic time. Consequently, these languages belong to \(\cal N\) \(\cal C\) 2. Moreover, we give results on SZLs of RCGs with phrase-structure rules and present several applications on SZLs of other regulated rewriting grammars.

Keywords

regulated rewriting grammars Szilard languages alternating Turing machines \(\cal N\) \(\cal C\) 1 and \(\cal N\) \(\cal C\) 2 complexity classes