Compact DFA representation for fast regular expression search

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

Volumn 2141 LNCS, Issue , 2001, Pages 1-13

  Navarro, Gonzalo ^a   Raffinot, Mathieu ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT DFA REPRESENTATION; CONSTRUCTION ALGORITHMS; DETERMINISTIC FINITE AUTOMATA; NONDETERMINISTIC FINITE AUTOMATON; OPERATOR SYMBOLS; REGULAR EXPRESSION SEARCH; REGULAR EXPRESSIONS; WORST CASE; SPECIFIC PROPERTIES;

ALGORITHMS; ENCODING (SYMBOLS); FINITE AUTOMATA; OPERATIONS RESEARCH; PIPELINE PROCESSING SYSTEMS;

MATHEMATICAL OPERATORS; PATTERN MATCHING;

EID: 78650718168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44688-5_1     Document Type: Conference Paper

References (13)

1. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1985.
2. R. Baeza-Yates and G. Gonnet. A new approach to text searching. CACM, 35(10):74-82, October 1992.
3. G. Berry and R. Sethi. From regular expression to deterministic automata. Theoretical Computer Science, 48(1):117-126, 1986.
4. A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120(2):197-213, November 1993.
5. C.-H. Chang and R. Paige. From regular expression to DFA's using NFA's. In Proceedings of the 3rd Annual Symposium on Combinatorial Pattern Matching, LNCS v. 664, pages 90-110, 1992.
6. V.-M. Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16:1-53, 1961.
7. E. Myers. A four-russian algorithm for regular expression pattern matching. J. of the ACM, 39(2):430-448, 1992.
8. G. Navarro and M. Raffinot. Fast regular expression search. In Proceedings of the 3rd Workshop on Algorithm Engineering, LNCS v. 1668, pages 199-213, 1999.
9. G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA), 5(4), 2000. http://www.jea.acm.org/2000/NavarroString.
10. K. Thompson. Regular expression search algorithm. CACM, 11(6):419-422, 1968.
11. B. Watson. Taxonomies and Toolkits of Regular Language Algorithms. Phd. dissertation, Eindhoven University of Technology, The Netherlands, 1995.
12. S. Wu and U. Manber. Agrep - a fast approximate pattern-matching tool. In Proc. of USENIX Technical Conference, pages 153-162, 1992.
13. S. Wu and U. Manber. Fast text searching allowing errors. CACM, 35(10):83-91, October 1992.