Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("HUNT HB III")

Results 1 to 18 of 18

  • Page / 1

Export

Selection :

  • and

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

ON THE DECIDABILITY OF GRAMMAR PROBLEMSHUNT HB III.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 2; PP. 429-447; BIBL. 23 REF.Article

A COMPLEXITY THEORY OF GRAMMAR PROBLEMS.HUNT HB III.1976; IN: CONF. RES. ACM. SYMP. PRINC. PROGRAM. LANG. 3. SYMP.; ATLANTA, GA.; 1976; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1976; PP. 12-18; BIBL. 18 REF.Conference Paper

OBSERVATIONS ON THE COMPLEXITY OF REGULAR EXPRESSION PROBLEMSHUNT HB III.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 3; PP. 222-236; BIBL. 17 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

EFFICIENT ALGORITHMS FOR STRUCTURAL SIMILARITY OF GRAMMARSHUNT HB III; ROSENKRANTZ DJ.1980; ANNUAL SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 7/1980/LAS VEGAS NV; USA; NEW YORK: ACM; DA. 1980; PP. 213-219; BIBL. 15 REF.Conference Paper

LOWER BOUNDS AND REDUCTIONS BETWEEN GRAMMARPROBLEMS.HUNT HB III; SZYMANSKI TG.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 32-51; BIBL. 16 REF.Article

COMPLEXITY METATHEOREMS FOR CONTEXT-FREE GRAMMAR PROBLEMS.HUNT HB III; SZYMANSKI TG.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 3; PP. 318-334; BIBL. 14 REF.Article

ECONOMY OF DESCRIPTION BY PARSERS, DPLA'S, AND PDA'S.GELLER MM; HUNT HB III.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 122-127; BIBL. 9 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

ON THE COMPLEXITY OF LR (K) TESTING.HUNT HB III; SZYMANSKI TG; ULLMAN JD et al.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 12; PP. 707-716; BIBL. 9 REF.; (2ND. ACM SYMP. PRINC. PROGRAM. LANG.; PALO ALTO, CALIF.; 1975)Conference Paper

ECONOMY OF DESCRIPTION BY PARSERS, DPDA'S AND PDA'S.GELLER MM; HUNT HB III; SZYMANSKY TG et al.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 2; PP. 143-153; BIBL. 13 REF.Article

  • Page / 1