Emily P. Friedman

Publication Activity (10 Years)

Years Active: 1973-1982
Publications (10 Years): 0

Harvard University (PHD)

Education History

Harvard University

PHD

Publications

Emily P. Friedman, Sheila A. Greibach
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors. SIAM J. Comput. 11 (1) (1982)
Sheila A. Greibach, Emily P. Friedman
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. J. ACM 27 (4) (1980)
Emily P. Friedman, Sheila A. Greibach
Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems. J. Comput. Syst. Sci. 19 (1) (1979)
Emily P. Friedman, Sheila A. Greibach
Monadic Recursion Schemes: The Effect of Constants. J. Comput. Syst. Sci. 18 (3) (1979)
Emily P. Friedman, Sheila A. Greibach
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. Inf. Process. Lett. 7 (6) (1978)
Emily P. Friedman
A Note on Non-Singular Deterministic Pushdown Automata. Theor. Comput. Sci. 7 (1978)
Emily P. Friedman
Simple Context-Free Languages and Free Monadic Recursion Schemes. Math. Syst. Theory 11 (1977)
Emily P. Friedman
Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes. J. Comput. Syst. Sci. 14 (3) (1977)
Emily P. Friedman
Simple Languages and Free Schemes FOCS (1976)
Emily P. Friedman
The Inclusion Problem for Simple Languages. Theor. Comput. Sci. 1 (4) (1976)
Emily P. Friedman
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages SWAT (1974)
Emily P. Friedman
Equivalence Problems in Monadic Recursion Schemes SWAT (1973)