Classes of Szilard Languages in NC^1

Authors:
Liliana Cojocaru;Erkki Makinen;Ferucio Laurentiu Tiplea
Affiliations:
-;-;-
Venue:
SYNASC '09 Proceedings of the 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Year:
2009

Citing 0
Cited 3

On the complexity of szilard languages of regulated grammars

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
On the generation of sentences with their parses by propagating regular-controlled grammars

Theoretical Computer Science
The Complexity of Szilard Languages of Matrix Grammars Revisited

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that Szilard languages of context-free grammars can be accepted by an indexing alternating Turing machine (indexing ATM) in logarithmic time and space. The same result holds for leftmost Szilard languages of unrestricted (phrase-structure or type 0) grammars. Since the class of languages recognizable by an indexing ATM in logarithmic time equals the U_E-uniform NC1 class, we obtain that the above classes of Szilard languages are in NC1. The inclusions are strict, since there exist languages in NC1 that cannot be Szilard languages of any context-free or unrestricted grammar.