Word problems requiring exponential time: Preliminary report

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1973, Pages 1-9

  Stockmeyer, L J ^a   Meyer, A R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; EQUIVALENCE CLASSES; PATTERN MATCHING;

EFFECTIVE SOLUTION; EQUIVALENCE PROBLEM; EXPONENTIAL TIME; REGULAR EXPRESSIONS; WORD PROBLEM;

CONTEXT SENSITIVE LANGUAGES;

EID: 84946836892     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800125.804029     Document Type: Conference Paper

References (17)

1. Meyer, A.R. And L.J. Stockmeyer. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space, 13th Annual IEEE Symp. On Switching and Automata Theory, Oct., 1972,125-129.
2. Hopcroft, J. And J. Ullman. Formal Languages and their Relation to Automata, Addison-Wesley, c. 1969, 242pp.
3. Cook, S. The Complexity of Theorem-Proving Procedures, Conf. Ree. 3rd ACM Symp. On Theory of Computing. 1970, 151-158.
4. Karp, R. Reducibility Among Combinatorial Problems, in Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, ed., Plenum Press, N.Y., 85-104.
5. Seiferas, J. Translations in the Nondeterministic Tape and Time Hierarchies, in preparation.
6. Ibarra, 0. A Note Concerning Nondeterministic Tape Complexities, JACM, Vol. 19, 1972, 608-612.
7. Cook, S. A Hierarchy for Nondeterministic Time Complexity, Conf. Ree. 4th ACM Symp. On Theory of Computing, 1972, 187-192.
8. Blum, M. On Effective Procedures for Speeding Up Algorithms, JACM Vol. 18, 1971, 290-305.
9. Meyer, A. And Stockmeyer, L. Some Inherently Difficult Word Problems, Part I, to appear in Journal of Computer and System Sciences.
10. Meyer, A. And Stockmeyer, L. Nonelementary Word Problems in Automata and Logic, to be presented at the Amer. Math. Soc. Symp. On the Complexity of Computation, New York, April 1973.
11. Bauer, M., D. Brand, M. Fischer, A. Meyer, and M. Paterson. A Note on Disjunctive Form Tautologies, SIGACT NEWS. 1973, to appear.
12. Savitch, W. Relationships Between Nondeterministic and Deterministic Tape Complexities, J. Computer and System Sciences Vol. 4, 1970, 177-192.
13. Stockmeyer, L. Some Inherently Difficult Word Problems, Part II, in preparation.
14. Brzozowski, J.A. Derivatives of Regular Expressions, JACM Vol. 11, 1964, 481-494.
15. Wiener, P. And T. Kameda. On the Reduction Qf Non-Deterministic Automata, Tech. Report No. 57, Dept. Of Electrical Engineering, Princeton University, 1968.
16. Ginzburg, A. A Procedure for Checking Equality of Regular Expressions, JACM. Vol 14, 355-362.
17. Oppen, D.C. Elementary Bounds for Presburger Arithmetic, this volume.