Emily P. Friedman

According to our database1, Emily P. Friedman authored at least 13 papers between 1973 and 1982.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1982
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors.
SIAM J. Comput., 1982

1980
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem.
J. ACM, 1980

1979
Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems.
J. Comput. Syst. Sci., 1979

Monadic Recursion Schemes: The Effect of Constants.
J. Comput. Syst. Sci., 1979

1978
A Note on Non-Singular Deterministic Pushdown Automata.
Theor. Comput. Sci., 1978

On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages.
Inf. Process. Lett., 1978

1977
Simple Context-Free Languages and Free Monadic Recursion Schemes.
Math. Syst. Theory, 1977

Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes.
J. Comput. Syst. Sci., 1977

1976
The Inclusion Problem for Simple Languages.
Theor. Comput. Sci., 1976

Simple Languages and Free Schemes
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1974
Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

Deterministic languages and monadic recursion schemes.
PhD thesis, 1974

1973
Equivalence Problems in Monadic Recursion Schemes
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973


  Loading...