The membership problem for regular expressions with intersection is complete in LOGCFL

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

Volumn 2285, Issue , 2002, Pages 513-522

  Petersen, Holger ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; PATTERN MATCHING;

LINEAR OUTPUT; LOG SPACE; MEMBERSHIP PROBLEM; REGULAR EXPRESSIONS; UPPER BOUND;

CONTEXT FREE LANGUAGES;

EID: 84937413913     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_42     Document Type: Conference Paper

References (23)

1. A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume A, Algorithms and Complexity, pages 255–300. MIT Press, Cambridge, MA, 1990.
2. A. Borodin, S. A. Cook, P. W. Dymond, W. L. Ruzzo, and M. Tompa. Two applications of inductive counting for complementation problems. SIAM Journal on Computing, 18:559–578, 1989.
3. S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2–22, 1985.
4. M. Fu¨rer. The complexity of the inequivalence problem for regular expressions with intersection. In J. W. D. Bakker and J. van Leeuwen, editors, Proceedings of the 7th International Colloquium on Automata, Languages and Programming (ICALP’80), Noordwijkerhout (Netherlands), number 85 in Lecture Notes in Computer Science, pages 234–245, Berlin-Heidelberg-New York, 1980. Springer.
5. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P -Completeness Theory. Oxford University Press, New York, Oxford, 1995.
6. S. A. Greibach. The hardest context-free language. SIAM Journal on Computing, 2:304–310, 1973.
7. S. C. Hirst. A new algorithm solving membership of extended regular expressions. Report 354, Basser Department of Computer Science, The University of Sydney, 1989.
8. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979.
9. H. B. Hunt. The equivalence problem for regular expressions with intersection is not polynomial in tape. Report TR 73-161, Department of Computer Science, Cornell University, 1973.
10. N. Immerman. Nondeterministic space is closed under complement. SIAM Journal on Computing, 17:935–938, 1988.
11. T. Jiang and B. Ravikumar. A note on the space complexity of some decision problems for finite automata. Information Processing Letters, 40:25–31, 1991.
12. D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume A, Algorithms and Complexity, pages 67–161. MIT Press, Cambridge, MA, 1990.
13. D. Kozen. Lower bounds for natural proof systems. In Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS’77), Providence (Rhode Island), pages 254–266. IEEE Computer Society Press, 1977.
14. M. Lohrey. On the parallel complexity of tree automata. In A. Middeldorp, editor, Proceedings of the 12th International Conference on Rewrite Techniques and Applications (RTA 2001), Utrecht (Netherlands), number 2051 in Lecture Notes in Computer Science, pages 201–215. Springer, 2001.
15. G. Myers. A four Russians algorithm for regular expression pattern matching. Journal of the Association for Computing Machinery, 39:430–448, 1992.
16. H. Petersen. Decision problems for generalized regular expressions. In Proceedings of the 2nd International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, London (Ontario), pages 22–29, 2000.
17. J. M. Robson. The emptiness of complement problem for semi extended regular expressions requires cn space. Information Processing Letters, 9:220–222, 1979.
18. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time. In Proceedings of the 5th ACM Symposium on Theory of Computing (STOC’73), Austin (Texas), pages 1–9, 1973.
19. I. H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery, 25:405–414, 1978.
20. R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279–284, 1988.
21. K. Thompson. Regular expression search algorithm. Communications of the Association for Computing Machinery, 11:419–422, 1968.
22. K. Wagner and G. Wechsung. Computational Complexity. Mathematics and its Applications. D. Reidel Publishing Company, Dordrecht, 1986.
23. H. Yamamoto. An automata-based recognition algorithm for semi-extended regular expressions. In M. Nielsen and B. Rovan, editors, Proceedings of the 25th Symposium on Mathematical Foundations of Computer Science (MFCS 2000), Bratislava (Slovakia), number 1893 in Lecture Notes in Computer Science, pages 699–708. Springer, 2000.