- CSB - MetaPress - Google - Bing - Yahoo
 | 1982 | |
|---|---|---|
| j9 |      | 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): 166-183 (1982) |
| 1980 | ||
| j8 | | Sheila A. Greibach, Emily P. Friedman: Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. J. ACM 27(4): 675-700 (1980) |
| 1979 | ||
| j7 | | Emily P. Friedman, Sheila A. Greibach: Monadic Recursion Schemes: The Effect of Constants. J. Comput. Syst. Sci. 18(3): 254-266 (1979) |
| j6 | | Emily P. Friedman, Sheila A. Greibach: Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems. J. Comput. Syst. Sci. 19(1): 79-117 (1979) |
| 1978 | ||
| j5 | | Emily P. Friedman, Sheila A. Greibach: On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. Inf. Process. Lett. 7(6): 287-290 (1978) |
| j4 | | Emily P. Friedman: A Note on Non-Singular Deterministic Pushdown Automata. Theor. Comput. Sci. 7: 333-339 (1978) |
| e3 |  | Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho (Eds.): Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. ACM 1978 |
| 1977 | ||
| j3 | | Emily P. Friedman: Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes. J. Comput. Syst. Sci. 14(3): 344-359 (1977) |
| j2 | | Emily P. Friedman: Simple Context-Free Languages and Free Monadic Recursion Schemes. Mathematical Systems Theory 11: 9-28 (1977) |
| e2 | | John E. Hopcroft, Emily P. Friedman, Michael A. Harrison (Eds.): Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA. ACM 1977 |
| 1976 | ||
| j1 | | Emily P. Friedman: The Inclusion Problem for Simple Languages. Theor. Comput. Sci. 1(4): 297-316 (1976) |
| c3 | | |
| e1 | | Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison (Eds.): Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. ACM 1976 |
| 1974 | ||
| c2 | | Emily P. Friedman: Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages. SWAT (FOCS) 1974: 43-51 |
| 1973 | ||
| c1 | | |
| 1 | Alfred V. Aho | |
| 2 | Walter A. Burkhard | |
| 3 | Ashok K. Chandra | |
| 4 | Sheila A. Greibach | |
| 5 | Michael A. Harrison | |
| 6 | John E. Hopcroft | |
| 7 | Richard J. Lipton | |
| 8 | Walter J. Savitch | |
| 9 | Detlef Wotschke |
Data released under the ODC-BY 1.0 license — See also our legal information page