An incremental algorithm for string pattern matching machines

References

• Aho , A. V. and Corasick , M. J. 1975 . Efficient string pattern matching: An aid to bibliographic search . Common. ACM , 18 ( 6 ) : 333 – 340 .
   Web of Science ®Google Scholar
• Aho , A. V. 1990 . Algorithms for Finding Patterns in Strings , Edited by: Leeuwen , J. 275 – 300 . Elsevier Science Publishers . Handbook of Theoretical Computer Science
   Google Scholar
• Aoe , J. , Yamamoto , Y. and Shimada , R. 1984 . A Method for Improving String Pattern Matching Machin-es . IEEE Trans. Software. Eng. , 10 ( 6 ) : 116 – 120 .
   Web of Science ®Google Scholar
• Aoe , J. 1989 . An Efficient Digital Search Algorithm by Using A Double-Array Structure . IEEE Trans. Software. Eng. , 15 ( 9 ) September : 1066 – 1077 .
   Web of Science ®Google Scholar
• Boyer , R. S. and Moore , J. S. 1977 . A fast string searching algorithm . Common ACM , 20 ( 10 ) September : 762 – 772 .
   Web of Science ®Google Scholar
• Knuth , D. E. , Morris , J. H. Jr. and Pratt , V. R. 1977 . Fast pattern matching in string . SIAM, J. Compute , 6 ( 2 ) September : 323 – 350 .
   Google Scholar
• Meyer , B. 1985 . Incremental string matching . Inf. Process. Let. , 21 ( 5 ) September : 219 – 227 .
   Web of Science ®Google Scholar