Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarEmily P. Friedman
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 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)- 1981
- [e4]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]Sheila A. Greibach, Emily P. Friedman:
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. J. ACM 27(4): 675-700 (1980)
1970 – 1979
- 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:
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. ACM 1978 [contents] - 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. Math. Syst. Theory 11: 9-28 (1977) - [e2]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]Emily P. Friedman:
The Inclusion Problem for Simple Languages. Theor. Comput. Sci. 1(4): 297-316 (1976) - [c3]Emily P. Friedman:
Simple Languages and Free Schemes. FOCS 1976: 159-165 - [e1]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
- [b1]Emily P. Friedman:
Deterministic languages and monadic recursion schemes. Harvard University, TR 24-74, 1974 - [c2]Emily P. Friedman:
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages. SWAT (FOCS) 1974: 43-51 - 1973
- [c1]Emily P. Friedman:
Equivalence Problems in Monadic Recursion Schemes. SWAT (FOCS) 1973: 26-33
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-05-19 01:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
