The equivalence problem for regular expressions with squaring requires exponential space

13th Annual Symposium on Switching and Automata Theory, SWAT 1972

Volumn , Issue , 1972, Pages 125-129

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84985359842     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SWAT.1972.29     Document Type: Conference Paper

References (7)

1. Hartmanis, J. and R.E. Stearns, "On the Computational Complexity of Algorithms", Trans. Amer. Math. Soc. 117, 1965, 285-306.
2. Hartmanis, J., P.M. Lewis, and R.E. Stearns, "Hierarchies of Memory Limited Computations", IEEE Conf. Rec. on Switching Th. and Logical Design, Sixth Ann. Symp., 1965, 179-190.
3. Shamir, E., "Relations Between Tape and Time Complexity Via Pushdown Machines", Abstract 72T- C23, Notices of Amer, Math. Soc. 19, 3, April 1972.
4. Meyer, A.R., "Weak Monadic Second Order Theory of Successor is Not Elementary-Recursive", manuscript, M.I.T., Project MAC, Cambridge, Mass., 1972.
5. Cook, S., "The Complexity of Theorem - Proving Procedures", Conf. Rec. of Third ACM Symp. on Th. of Computing, 1970, 151-158.
6. Karp, R.M., "Reducibility Among Combinatorial Problems", Tech. Report 2 Dept. of Computer Sci., University of California, Berkeley, 1972.
7. Rogers, H. Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.