- Harry B. Hunt III and Daniel J. Rosenkrantz. On equivalence and containment
problems for formal languages. Journal of the ACM,
24(3):387-396, July 1977.
- Harry B. Hunt III and Thomas G. Szymanski. Lower bounds and reductions between
grammar problems. Journal of the ACM, 25(1):32-51,
January 1978.
Citations.
- Harry B. Hunt III and Thomas G. Szymanski. Corrigendum: ``Lower bounds and
reductions between grammar problems''. Journal of the
ACM, 25(4):687-688, October 1978.
References.
- H. B. Hunt, III. On the
complexity of flowchart and loop program schemes and programming
languages. Journal of the ACM, 29(1):228-249, January
1982.
- H. B. Hunt, III. On the
decidability of grammar problems. Journal of the ACM,
29(2):429-447, April 1982.
- H. B. Hunt III. Terminating
Turing machine computations and the complexity and/or decidability of
correspondence problems, grammars, and program schemes.
Journal of the ACM, 31(2):299-318, April 1984.
Citations.
- P. A. Bloniarz, H. B. Hunt, III, and D. J. Rosenkrantz. Algebraic structures with hard
equivalence and minimization problems. Journal of the
ACM, 31(4):879-904, October 1984.
Citations.
Shortcuts: