The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Emily P. Friedman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Emily P. Friedman
    Equivalence Problems in Monadic Recursion Schemes [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:26-33 [Conf]
  2. Emily P. Friedman
    Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:43-51 [Conf]
  3. Emily P. Friedman
    Simple Languages and Free Schemes [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:159-165 [Conf]
  4. Emily P. Friedman, Sheila A. Greibach
    On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:6, pp:287-290 [Journal]
  5. Sheila A. Greibach, Emily P. Friedman
    Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:675-700 [Journal]
  6. Emily P. Friedman
    Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1977, v:14, n:3, pp:344-359 [Journal]
  7. Emily P. Friedman, Sheila A. Greibach
    Monadic Recursion Schemes: The Effect of Constants. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:18, n:3, pp:254-266 [Journal]
  8. Emily P. Friedman, Sheila A. Greibach
    Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:1, pp:79-117 [Journal]
  9. Emily P. Friedman
    Simple Context-Free Languages and Free Monadic Recursion Schemes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:11, n:, pp:9-28 [Journal]
  10. Emily P. Friedman, Sheila A. Greibach
    A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:166-183 [Journal]
  11. Emily P. Friedman
    The Inclusion Problem for Simple Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:1, n:4, pp:297-316 [Journal]
  12. Emily P. Friedman
    A Note on Non-Singular Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:7, n:, pp:333-339 [Journal]

Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002