Application and Research of Finite State Automata in Pattern Matching
Zuo Jin-ping · Journal of Jinzhong University · 2011
Finite automata matching algorithm is an important multi-pattern matching algorithm.Under certain conditions,reverse finite automata can compress the size of automata to improve pattern matching speed.Combining the reverse finite automata and BM algorithm,using the current accessed information to further increase the jump distance in the matching process,can further improve the speed of pattern matching.