ask others

Emily P. Friedman

> Home > Persons

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

showing all ?? records

1980 – 1989

see FAQ

What is the meaning of the colors in the publication lists?

1982
[j9]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/siamcomp/FriedmanG82
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/siamcomp/FriedmanG82
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)
1981
[e4]
- view
  - table of contents in dblp
  - electronic edition via DOI
- export record
  dblp key:
  - conf/acm/1981
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/acm/1981
Toni Shelter, Steven Abraham, Emily P. Friedman, Beth Levy:
Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981. ACM 1981, ISBN 0-89791-049-4 [contents]
1980
[j8]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jacm/GreibachF80
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jacm/GreibachF80
Sheila A. Greibach, Emily P. Friedman:
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. J. ACM 27(4): 675-700 (1980)

1970 – 1979

see FAQ

What is the meaning of the colors in the publication lists?

1979
[j7]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jcss/FriedmanG79
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jcss/FriedmanG79
Emily P. Friedman, Sheila A. Greibach:
Monadic Recursion Schemes: The Effect of Constants. J. Comput. Syst. Sci. 18(3): 254-266 (1979)
[j6]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jcss/FriedmanG79a
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jcss/FriedmanG79a
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/ipl/FriedmanG78
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/ipl/FriedmanG78
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]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tcs/Friedman78
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tcs/Friedman78
Emily P. Friedman:
A Note on Non-Singular Deterministic Pushdown Automata. Theor. Comput. Sci. 7: 333-339 (1978)
[e3]
- view
  - table of contents in dblp
- export record
  dblp key:
  - conf/stoc/STOC10
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/STOC10
Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho:
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. ACM 1978 [contents]
1977
[j3]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/jcss/Friedman77
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jcss/Friedman77
Emily P. Friedman:
Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes. J. Comput. Syst. Sci. 14(3): 344-359 (1977)
[j2]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/mst/Friedman77
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/mst/Friedman77
Emily P. Friedman:
Simple Context-Free Languages and Free Monadic Recursion Schemes. Mathematical Systems Theory 11: 9-28 (1977)
[e2]
- view
  - table of contents in dblp
- export record
  dblp key:
  - conf/stoc/STOC9
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/STOC9
John E. Hopcroft, Emily P. Friedman, Michael A. Harrison:
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA. ACM 1977 [contents]
1976
[j1]
- view
  - electronic edition via DOI
- export record
  dblp key:
  - journals/tcs/Friedman76
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/tcs/Friedman76
Emily P. Friedman:
The Inclusion Problem for Simple Languages. Theor. Comput. Sci. 1(4): 297-316 (1976)
[c3]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/Friedman76
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/Friedman76
Emily P. Friedman:
Simple Languages and Free Schemes. FOCS 1976: 159-165
[e1]
- view
  - table of contents in dblp
- export record
  dblp key:
  - conf/stoc/STOC8
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/stoc/STOC8
Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison:
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. ACM 1976 [contents]
1974
[c2]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/Friedman74
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/Friedman74
Emily P. Friedman:
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages. SWAT (FOCS) 1974: 43-51
1973
[c1]
- view
  - electronic edition via DOI
  - electronic edition @ ieeecomputersociety.org
- export record
  dblp key:
  - conf/focs/Friedman73
- ask others
- share record
  short URL:
  - https://dblp.org/rec/conf/focs/Friedman73
Emily P. Friedman:
Equivalence Problems in Monadic Recursion Schemes. SWAT (FOCS) 1973: 26-33

Coauthor Index

see FAQ

maintained by

, founded at