An improved algorithm for the membership problem for extended regular expressions

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

Volumn 2420, Issue , 2002, Pages 446-458

  Kupferman, Orna ^a   Zuhovitzky, Sharon ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

ALTERNATING AUTOMATA; BEST-KNOWN ALGORITHMS; COMPLEMENTATION; EXTENDED REGULAR EXPRESSIONS; MEMBERSHIP PROBLEM; REGULAR EXPRESSIONS; SIMPLE AND EFFICIENT ALGORITHMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 84957019896     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_37     Document Type: Conference Paper

References (15)

1. A.V. Aho. Algorithms for finding patterns in strings. Handbook of Theoretical Computer Science, pages 255–300, 1990.
2. J. Dassow, J. Hromkovic, J. Karhumaki, B. Rovan, and A. Slobodova. On the power of synchronization in parallel computing. In Proc. 14th International Symp. on Mathematical Foundations of Computer Science, volume 379 of Lecture Notes in Computer Science, pages 196–206. Springer-Verlag, 1989.
3. S. Hirst. A new algorithm solving membership of extended regular expressions. Technical report, Basser Department of Computer Science, The University of Sydney, 1989.
4. J.E. Hopcroft, R. Motwani, and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation (2nd Edition). Addison-Wesley, 2000.
5. J. Hrokovic. Tradeoffs for language recognition on parallel computing models. In Proc. 13th Colloq. on Automata, Programming, and Languages, volume 226 of Lecture Notes in Computer Science, pages 156–166. Springer- Verlag, 1986.
6. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
7. 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.
8. James R. Knight and Eugene W. Myers. Super-pattern matching. Algorithmica, 13(1/2):211–243, 1995.
9. O. Kupferman, A. Ta-Shma, and M.Y. Vardi. Counting with automata. Submitted, 2001.
10. A.R. Meyer and L.J. Stockmeyer. Word problems requiring exponential time: Preliminary report. In Proc. 5th ACM Symp. on Theory of Computing, pages 1–9, 1973.
11. G. Myers. A four russians algorithm for regular expression pattern matching. Journal of the Association for Computing Machinery, 39(4):430–448, 1992.
12. H. Petersen. The membership problem for regular expressions with intersection is complete in LOGCFL. In Proc. 18th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science. Springer- Verlag, 2002.
13. A. Slobodova. On the power of communication in alternating machines. In Proc. 13th International Symp. on Mathematical Foundations of Computer Science, volume 324 of Lecture Notes in Computer Science, pages 518–528, 1988.
14. H. Yamamoto. An automata-based recognition algorithm for semiextended regular expressions. In Proc. 25th International Symp. on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 699–708. Springer-Verlag, 2000.
15. H. Yamamoto. On the power of input-synchronized alternating finite automata. In Proc. 6th International Computing and Combinatorics Conference, volume 1858 of Lecture Notes in Computer Science, pages 457–466, 2000.