A new regular grammar pattern matching algorithm

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

Volumn 1136, Issue , 1996, Pages 364-377

  Watson, Bruce W ^a,b  

^a Ribbit Software Systems Inc   (Canada)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

AHO-CORASICK; AHO-CORASICK ALGORITHMS; BOYER-MOORE; PATTERN MATCHING ALGORITHMS; PRE-COMPUTATION; REGULAR GRAMMAR; SHIFT FUNCTIONS;

ALGORITHMS;

EID: 84958038004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_68     Document Type: Conference Paper

References (20)

1. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search, Comm. ACM, 18(6) (1975) 333-340.
2. Aho, A.V.: Pattern matching in strings, in: Book, R.V., ed., Formal Language Theory: Perspectives and Open Problems. (Academic Press, New York, 1980) 325-347.
3. Aho, A.V.: Algorithms for finding patterns in strings, in: van Leeuwen, J., ed., Handbook of Theoretical Computer Science, Vol. A. (North-Holland, Amsterdam, 1990) 257-300.
4. Baeza-Yates, R.: Effcient Text Searching. (Ph.D dissertation, University of Waterloo, Canada, May 1989).
5. Boyer, R.S., Moore, J.S.: A fast string searching algorithm, Comm. ACM, 20(10) (1977) 62-72.
6. Commentz-Walter, B.: A string matching algorithm fast on the average, in: Maurer, H.A., ed., Proc. 6th Internat. Coll. on Automata, Languages and Programming (Springer-Verlag, Berlin, 1979) 118-132.
7. Commentz-Walter, B.: A string matching algorithm fast on the average, Technical Report TR 79.09.007, IBM Germany, Heidelberg Scientific Center, 1979.
8. Crochemore, M., Rytter, W.: Text Algorithms. (Oxford University Press, Oxford, England, 1994).
9. Fredkin, E.: Trie memory, Comm. ACM 3(9) (1960) 490-499.
10. Gonnet, G.H., Baeza-Yates, R.: Handbook of Algorithms and Data Structures (In Pascal and C). (Addison-Wesley, Reading, MA, 2nd edition, 1991).
11. Hume, S.C., Sunday, D.: Fast string searching, Software--Practice and Experience 21(11) (1991) 1221-1248.
12. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings, SIAM J. Comput. 6(2) (1977) 323-350.
13. Watson, B.W.: The performance of single-keyword and multiple-keyword pattern matching algorithms, Computing Science Report 94/19, Eindhoven University of Technology, The Netherlands, 1994. Available for ftp from ftp.win.rue.nl in directory/pub/techreports/pi/pattm/.
14. Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. (Ph.D dissertation, Eindhoven University of Technology, The Netherlands, 1995). Contact the watson@RibbitSoft.com.
15. Watson, B.W.: A Boyer-Moore (or Watson-Watson) type algorithm for regular tree pattern matching, in: Aarts, E.H.L., ten Eikelder, H.M.M., Hemerik, C., Rem, M., eds., Simplex Sigillum Veri: Een Liber Amicorum voor prof.dr. F.E.J. Kruseman Aretz (Eindhoven University of Technology, ISBN 90-386-0197-2, 1995) 315-320.
16. Watson, B.W., Watson, R.E.: A Boyer-Moore type algorithm for regular expression pattern matching, Computing Science Report 94/31, Eindhoven University of Technology, The Netherlands, 1994. Available by e-mail from Watson@RibbitSoft.com.
17. Watson, B.W., Zwaan, G.: A taxonomy of keyword pattern matching algorithms, Computing Science Report 92/27, Eindhoven University of Technology, The Netherlands, 1992. Available by e-mail from Watson@RibbitSoft.com or wsinswan@win.tue.nl.
18. Watson, B.W., Zwaan, G.: A taxonomy of sublinear multiple keyword pattern matching algorithms, Computing Science Report 95/13, Eindhoven University of Technology, The Netherlands, 1994. Available by e-mall from wsinswan@win.tue.nl.
19. Watson, B.W., Zwaan, G.: A taxonomy of sublinear multiple keyword pattern matching algorithms, to appear in: Science of Computer Programming, (1996).
20. Zwaan, G.: Sublinear pattern matching, in: Aarts, E.H.L., ten Eikelder, H.M.M., Hemerik, C., Rein, M., eds., Simplex Sigillum Veri: Een Liber Amicorum voor prof.dr. F.E.J. Kruseman Aretz (Eindhoven University of Technology, ISBN 90-386-0197-2, 1995) 335-350.