On the complexity of szilard languages of regulated grammars

Authors:
Liliana Cojocaru;Erkki Mäkinen
Affiliations:
School of Information Sciences, Computer Science, University of Tampere, Tampere, Finland;School of Information Sciences, Computer Science, University of Tampere, Tampere, Finland
Venue:
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Year:
2011

Citing 11
Cited 0

Formal languages

Formal languages
Structural complexity 2

Structural complexity 2
Programmed Grammars and Classes of Formal Languages

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
A shrinking lemma for random forbidding context languages

Theoretical Computer Science
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
A pumping lemma for random permitting context languages

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Division Is in Uniform TC0

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Classes of Szilard Languages in NC^1

SYNASC '09 Proceedings of the 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

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 lowlevel complexity classes such as NC1 and NC2. 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 UE*-uniform NC1 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 NC2. Moreover, we give results on SZLs of RCGs with phrase-structure rules and present several applications on SZLs of other regulated rewriting grammars.