Prefix-free regular-expression matching

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 298-309

  Han, Yo Sub ^a   Wang, Yajun ^a   Wood, Derick ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; PROBLEM SOLVING;

PREFIX-FREENESS; REGULAR-EXPRESSION MATCHING; SUBSTRINGS;

PATTERN MATCHING;

EID: 26444504118     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_26     Document Type: Conference Paper

References (11)

1. A. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, 255-300. The MIT Press, Cambridge, MA, 1990.
2. A. Aho and M. Corasick. Efficient string matching: An aid to bibliographic search. Communications of the ACM, 18:333-340, 1975.
3. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762-772, 1977.
4. C. L. A. Clarke and G. V. Cormack. On the use of regular expressions for searching text. ACM Transactions on Programming Languages and Systems, 19(3):413-426, 1997.
5. M. Crochemore and C. Hancart. Automata for matching patterns. In G. Rozenberg and A. Salomaa, editors, Linear modeling: background and application, volume 2 of Handbook of Formal Languages, 399-462. Springer-Verlag, 1997.
6. D. Giammarresi and R. Montalbano. Deterministic generalized automata. Theoretical Computer Science, 215:191-208, 1999.
7. Y.-S. Han and D. Wood. The generalization of generalized automata: Expression automata. In Proceedings of CIAA'04, 156-166. Springer-Verlag, 2004. Lecture Notes in Computer Science 3317.
8. J. Hopcroft and J. Ullman. Formal Languages and Their Relationship to Automata. Addison-Wesley, Reading, MA, 1969.
9. D. Knuth, J. Morris, Jr., and V. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6:323-350, 1977.
10. E. W. Myers, P. Oliva, and K. S. Guimãraes. Reporting exact and approximate regular expression matches. In Proceedings of CPM'98, 91-103. Springer-Verlag, 1998. Lecture Notes in Computer Science 1448.
11. K. Thompson. Regular expression search algorithm. Communications of the ACM, 11:419-422, 1968.