EQUIVALENCE PROBLEMS FOR DETERMINISTIC CONTEXT-FREE LANGUAGES AND MONADIC RECURSION SCHEMES.FRIEDMAN EP.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 3; PP. 344-359; BIBL. 8 REF.Article

SUPERDETERMINISTIC PDAS: A SUBCASE WITH A DECIDABLE INCLUSION PROBLEMGREIBACH SA; FRIEDMAN EP.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 675-700; BIBL. 29 REF.Article

A POLYNOMIAL TIME ALGORITHM FOR DECIDING THE EQUIVALENCE PROBLEM FOR 2-TAPE DETERMINISTIC FINITE STATE ACCEPTORSFRIEDMAN EP; GREIBACH SA.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 166-183; BIBL. 9 REF.Article

ON EQUIVALENCE AND SUBCLASS CONTAINMENT PROBLEMS FOR DETERMINISTIC CONTEXT-FREE LANGUAGESFRIEDMAN EP; GREIBACH SA.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 6; PP. 287-290; BIBL. 21 REF.Article

MONADIC RECURSION SCHEMES: THE EFFECT OF CONSTANTSFRIEDMAN EP; GREIBACH SA.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 3; PP. 254-266; BIBL. 18 REF.Article