Complexity metatheorems for context-free grammar problems

Authors:
Harry B. Hunt, III;Thomas G. Szymanski
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1976

Citing 6
Cited 0

An Overview of the Theory of Computational Complexity

Journal of the ACM (JACM)
On the complexity of LR(k) testing

Communications of the ACM
Computational parallels between the regular and context-free languages

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Formal languages and their relation to automata

Formal languages and their relation to automata
Simple deterministic languages

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
LR-regular grammars-an extension of LR(k) grammars

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Metatheorems are presented which can be used to (i) establish undecidability results about context-free grammar problems, and (ii) establish lower bounds on certain decidable grammar problems. The main undecidability result is obtained through the simulation of a Turing machine which always halts. This technique promises to be applicable in many situations where conventional techniques for proving undecidability do not succeed.