A deterministic finite automata based on improved BM algorithm

By analyzing the BM algorithm and DFA theory, a kind of DFA based on improved BM algorithm has been designed in this paper. The DFA based on improved BM algorithm match the pattern string with the text string following the rules: compare from the pattern at both ends of string to the middle alternately. It shows that the characters matching to the patterns exist in the text strings when the DFA based on improved BM algorithm output true,the characters matching to the patterns do not exist in the text strings when it output false. This paper analyzes the effectiveness of the DFA based on improved BM algorithm through simulation and comparative experiments. The experimental data show that the DFA based on improved BM algorithm can improve the efficiency of the pattern matching.