Compact and fast algorithms for safe regular expression search

International Journal of Computer Mathematics

Volumn 81, Issue 4, 2004, Pages 383-401

  Champarnaud, J M ^a   Coulon, F ^a   Paranthoen T ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

Bitwise techniques; Homogeneous NFAs; NFA determinization; Regular expression search

Indexed keywords

COMPUTER SOFTWARE; FINITE AUTOMATA; PATTERN MATCHING; TEXT PROCESSING;

BITWISE TECHNIQUES; HOMOGENEOUS NFAS; NFA DETERMINIZATION; REGULAR EXPRESSION SEARCH;

ALGORITHMS;

EID: 6344227328     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160310001650025     Document Type: Article

References (12)

1. Champarnaud, J.-M. (2001). Subset construction complexity for homogeneous automata, position automata and ZPC-structures. Theoret. Comp. Sc., 267(1-2), 17-34.
2. Caron, P. and Ziadi, D. (2000). Characterization of Glushkov automata. Theoret. Comp. Sc., 233, 75-90.
3. Ponty, J.-L. (2000). An efficient null-free procedure for deciding regular language membership. Theoret. Comp. Sc., 231, 89-101.
4. Navarro, G. and Raffinot, M. (2001). Compact DFA representation for fast regular expression search. In: G. S. Brodal, D. Frigioni and A. Marchetti-Spacamella (Eds.) Lecture Notes in Computer Science, 5th Workshop of Algorithm Engineering, No. 2141. Springer-Verlag, Berlin, pp. 1-12.
5. Champarnaud, J.-M. (2002). A propos du calcul exhaustif du déterminisé d'un automate homogène. Manuscript.
6. Coulon, F. (2003). CCP - a compact and fast algorithm for regular expression search. Source code, http://www.univ-rouen.fr/LIFAR/aia/ccp.html, http://www.cs.ucr.edu/stelo/pattern.html.
7. Yu, S. (1997). Regular languages. In: G. Rozenberg and A. Salomaa (Eds.) Handbook of Formal Languages. Word, Language, Grammar. Volume I. Springer-Verlag, Berlin, pp. 41-110.
8. Navarro, G. and Raffinot, M. (2002). Flexible Pattern Matching in Strings - Practical On-line Search Algorithms for Texts and Biological Sequences. Cambridge University Press (ISBN 0-521-81307-7).
9. Wu, S. and Manber, U. (1992). Fast text searching algorithm allowing errors. CACM. 35(10) October, pp. 83-91.
10. Brüggemann-Klein, A. (1993). Regular expressions into finite automata. Theoret. Comp. Sc., 120, 197-213.
11. Chang, C.-H. and Paige, R. (1992). From regular expression to DFAs using NFAs. In: A. Apostolico, M. Crochemore, Z. Galil and U. Manber (Eds.) Lecture Notes in Computer Science, 3rd Symposium on Combinatorial Pattern Matching. No. 664. Springer-Verlag, Berlin, pp. 90-110.
12. Ponty, J.-L., Ziadi, D. and Champarnaud, J.-M. (1997). A new quadratic algorithm to convert a regular expression into an automaton. In: D. Raymond and S. Yu (Eds.) Lecture Notes in Computer Science, First Workshop on Implementing Automata. No. 1260. Springer-Verlag, Berlin, pp. 109-119.