@article{HuntIII1976318,
    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.},
    Author = {III, Harry B. Hunt and Szymanski, Thomas G.},
    File = {Complexity metatheorems for context-free grammar problems - III, Szymanski (0) (0) - a - a - n.pdf},
    ISSN = {0022-0000},
    Journal = {Journal of Computer and System Sciences},
    Number = {3},
    Pages = {318 - 334},
    Title = {Complexity metatheorems for context-free grammar problems},
    URL = {http://www.sciencedirect.com/science/article/pii/S002200007680044X},
    Volume = {13},
    Year = {1976},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S002200007680044X},
    bdsk-url-2 = {http://dx.doi.org/10.1016/S0022-0000(76)80044-X},
    date-added = {2016-01-13 12:03:24 +0000},
    date-modified = {2016-01-13 12:03:24 +0000},
    doi = {10.1016/S0022-0000(76)80044-X}
}

@article{HuntIII1976318, 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.}, Author = {III, Harry B. Hunt and Szymanski, Thomas G.}, File = {Complexity metatheorems for context-free grammar problems - III, Szymanski (0) (0) - a - a - n.pdf}, ISSN = {0022-0000}, Journal = {Journal of Computer and System Sciences}, Number = {3}, Pages = {318 - 334}, Title = {Complexity metatheorems for context-free grammar problems}, URL = {http://www.sciencedirect.com/science/article/pii/S002200007680044X}, Volume = {13}, Year = {1976}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S002200007680044X}, bdsk-url-2 = {http://dx.doi.org/10.1016/S0022-0000(76)80044-X}, date-added = {2016-01-13 12:03:24 +0000}, date-modified = {2016-01-13 12:03:24 +0000}, doi = {10.1016/S0022-0000(76)80044-X} }