Emily P. Friedman

17 papers A* 4Journal 9Unranked 2
YearRankTypeTitle / Venue / Authors
1982 J jnl
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors.
SIAM J. Comput.
Emily P. Friedman, Sheila A. Greibach
1981 — ed.
Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981.
ACM Annual Conference
Toni Shelter, Steven Abraham, Emily P. Friedman, Beth Levy
1980 J jnl
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem.
J. ACM
Sheila A. Greibach, Emily P. Friedman
1979 J jnl
Monadic Recursion Schemes: The Effect of Constants.
J. Comput. Syst. Sci.
Emily P. Friedman, Sheila A. Greibach
1979 J jnl
Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems.
J. Comput. Syst. Sci.
Emily P. Friedman, Sheila A. Greibach
1978 J jnl
A Note on Non-Singular Deterministic Pushdown Automata.
Theor. Comput. Sci.
Emily P. Friedman
1978 J jnl
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages.
Inf. Process. Lett.
Emily P. Friedman, Sheila A. Greibach
1978 A* ed.
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA
STOC
Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho
1977 J jnl
Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes.
J. Comput. Syst. Sci.
Emily P. Friedman
1977 A* ed.
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA
STOC
John E. Hopcroft, Emily P. Friedman, Michael A. Harrison
1977 J jnl
Simple Context-Free Languages and Free Monadic Recursion Schemes.
Math. Syst. Theory
Emily P. Friedman
1976 A* ed.
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA
STOC
Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison
1976 A* conf
Simple Languages and Free Schemes
FOCS
Emily P. Friedman
1976 J jnl
The Inclusion Problem for Simple Languages.
Theor. Comput. Sci.
Emily P. Friedman
1974 — —
Deterministic languages and monadic recursion schemes.
Emily P. Friedman
1974 — conf
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages
SWAT
Emily P. Friedman
1973 — conf
Equivalence Problems in Monadic Recursion Schemes
SWAT
Emily P. Friedman