| 1982 |
|---|
| 12 | | 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 |
|---|
| 11 | EE | Sheila A. Greibach,
Emily P. Friedman:
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem.
J. ACM 27(4): 675-700 (1980) |
| 1979 |
|---|
| 10 | | Emily P. Friedman,
Sheila A. Greibach:
Monadic Recursion Schemes: The Effect of Constants.
J. Comput. Syst. Sci. 18(3): 254-266 (1979) |
| 9 | | 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 |
|---|
| 8 | | 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) |
| 7 | | Emily P. Friedman:
A Note on Non-Singular Deterministic Pushdown Automata.
Theor. Comput. Sci. 7: 333-339 (1978) |
| 1977 |
|---|
| 6 | | Emily P. Friedman:
Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes.
J. Comput. Syst. Sci. 14(3): 344-359 (1977) |
| 5 | | Emily P. Friedman:
Simple Context-Free Languages and Free Monadic Recursion Schemes.
Mathematical Systems Theory 11: 9-28 (1977) |
| 1976 |
|---|
| 4 | | Emily P. Friedman:
Simple Languages and Free Schemes
FOCS 1976: 159-165 |
| 3 | | Emily P. Friedman:
The Inclusion Problem for Simple Languages.
Theor. Comput. Sci. 1(4): 297-316 (1976) |
| 1974 |
|---|
| 2 | | Emily P. Friedman:
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages
FOCS 1974: 43-51 |
| 1973 |
|---|
| 1 | | Emily P. Friedman:
Equivalence Problems in Monadic Recursion Schemes
FOCS 1973: 26-33 |
