+Advanced Search

A Boyer-Moore Type String Matching Algorithm with Memory and Its Computational Complexity
Author:
Affiliation:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
    Abstract:

    A new string matching automata was constructed. The automata had the advantage that each of the matching windows always kept the uniform form in which the left part in this window was a prefix of the pattern and the characters of the right part were not c

    Reference
    Related
    Cited by
Article Metrics
  • PDF:
  • HTML:
  • Abstract:
  • Cited by:
Get Citation
History
  • Received:December 13,2006
  • Revised:December 13,2006
  • Adopted:
  • Online:
  • Published: