Equivalence Problems in Monadic Recursion Schemes - Emily P. Friedman (SWAT, 1973)

Deterministic languages and monadic recursion schemes. - Emily P. Friedman (1974)

Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages - Emily P. Friedman (SWAT, 1974)

Simple Languages and Free Schemes - Emily P. Friedman (FOCS, 1976)

The Inclusion Problem for Simple Languages. - Emily P. Friedman (Theor. Comput. Sci., 1976)

Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes. - Emily P. Friedman (J. Comput. Syst. Sci., 1977)

Simple Context-Free Languages and Free Monadic Recursion Schemes. - Emily P. Friedman (Math. Syst. Theory, 1977)

On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. - Emily P. Friedman; Sheila A. Greibach (Inf. Process. Lett., 1978)

A Note on Non-Singular Deterministic Pushdown Automata. - Emily P. Friedman (Theor. Comput. Sci., 1978)

Monadic Recursion Schemes: The Effect of Constants. - Emily P. Friedman; Sheila A. Greibach (J. Comput. Syst. Sci., 1979)

Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems. - Emily P. Friedman; Sheila A. Greibach (J. Comput. Syst. Sci., 1979)

Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. - Sheila A. Greibach; Emily P. Friedman (J. ACM, 1980)

A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors. - Emily P. Friedman; Sheila A. Greibach (SIAM J. Comput., 1982)