ON THE COMPLEXITY OF FINITE, PUSHDOWN, AND STACKAUTOMATA.HUNT HB III.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976; VOL. 10; NO 1; PP. 33-52; BIBL. 39 REF.Article

ON THE COMPLEXITY OF FLOWCHART AND LOOP PROGRAM SCHEMES AND PROGRAMMING LANGUAGESHUNT HB III.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 1; PP. 228-249; BIBL. 14 REF.Article

POLYNOMIAL ALGORITHMS FOR DETERMINISTIC PUSHDOWN AUTOMATAROSENKRANTZ DJ; HUNT HB III.1978; S. I.A.M.J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 405-412; BIBL. 18 REF.Article

ON EQUIVALENCE AND CONTAINMENT PROBLEMS FOR FORMAL LANGUAGES.HUNT HB III; ROSENKRANTZ DJ.1977; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1977; VOL. 24; NO 3; PP. 387-396; BIBL. 24 REF.Article

DECIDABILITY OF EQUIVALENCE, CONTAINMENT, INTERSECTION, AND SEPARABILITY OF CONTEXT-FREE LANGUAGES.HUNT HB III; RANGEL JL.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 144-150; BIBL. 16 REF.Conference Paper

ON THE EQUIVALENCE, CONTAINMENT, AND COVERING PROBLEMS FOR THE REGULAR AND CONTEXT-FREE LANGUAGES.HUNT HB III; ROSENKRANTZ DJ; SZYMANSKI TG et al.1976; J. COMPUTER. SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 2; PP. 222-268; BIBL. 1 P. 1/2; (ANNU. ACM SYMP. THEORY COMPUT. 6; SEATTLE, WASH.; 1974)Conference Paper

ON THE COMPUTATIONAL COMPLEXITY OF PROGRAM SCHEME EQUIVALENCEHUNT HB III; CONSTABLE RL; SAHNI S et al.1980; S.I.A.M. J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 396-416; BIBL. 14 REF.Article

THE COVERING PROBLEM FOR LINEAR CONTEXT-FREE GRAMMARS.HUNT HB III; ROSENKRANTZ DJ; SZYMANSKI TG et al.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 2; NO 3; PP. 361-382; BIBL. 11 REF.Article

OPERATIONS ON SPARSE RELATIONS.HUNT HB III; SZYMANSKI TG; ULLMAN JD et al.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 3; PP. 171-176; BIBL. 13 REF.Article