The complexity of the inequivalence problem for regular expressions with intersection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 85 LNCS, Issue , 1980, Pages 234-245

  Fürer, Martin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; PATTERN MATCHING;

LOWER BOUNDS; ONE-LETTER ALPHABET; REGULAR EXPRESSIONS; SPACE BOUNDS; UPPER BOUND;

C (PROGRAMMING LANGUAGE);

EID: 85029796344     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10003-2_74     Document Type: Conference Paper

References (12)

1. Aho, A. V., J. E. Hopcroft and J. D. Ullman, “The Design and Analysis of Computer Algorithms”, Addison-Wesley, Reading, Mass., 1974.
2. Chandra, A. K. and L. J. Stockmeyer, “Alternation”, Proc. 17th Annual IEEE Symposium on Foundations of Comp. Sci., 98–108, 1976.
3. Fürer, M., “Non-elementary lower bounds in automata theory”, (in German), Diss. ETH 6122 (Ph. D. Thesis), Zürich, 1978.
4. Hopcroft, J. E., W. J. Paul and L. G. Valiant, “On Time Versus Space”, Journal of the Association for Computing Machinery 24, 332–337, 1977.
5. Hunt, H. B. III “The equivalence problem for regular expressions with intersection is not polynomial in tape”, Tech. Report TR 73-161, Dept. of Computer Science, Cornell University, 1973.
6. Hunt, H. B. III D. J. Rosenkrantz and T. G. Szymanski, “On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages”, J. of Computer and System Sciences 12, 222–268, 1976.
7. Kozen, D., “On parallelism in Turing machines”, Proc. 17th Annual IEEE Symposium on Foundations of Comp. Sci., 89–97, 1976.
8. Meyer, A. R. and L. J. Stockmeyer, “The equivalence problem for regular expressions with squaring requires exponential space”, Proc. 13th Annual IEEE Symposium on Switching and Automata Theory, 125–129, 1972.
9. Rangel, J. L. “The Equivalence Problem for Regular Expressions over One Letter is Elementary”, 15th Annual Symposium on Switching and Automata Theory, 24–27, 1974.
10. Sieferas, J. I., M. J. Fischer and A. R. Meyer, “Refinements of the Nondeterministic Time and Space Hierarchies”, Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, 130–137, 1973.
11. Stockmeyer, L. J., “The complexity of decision problems in automata theory and logic”. Report TR-133, M. I. T., Project MAC, Cambridge, Mass., 1974.
12. Stockmeyer, L. J. and A. R. Meyer, “Word Problems Requiring Exponential Time: Preliminary Report”, Proc. 5th Annual ACM Symposium on the Theory of Computing, 1–9, 1973.