ScholarLens Back to search
2010•Unpublished venueRequires access

A deterministic finite automata based on improved BM algorithm

Chao Yin

Open publisher page 1 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: String searching algorithm, Deterministic finite automaton, Commentz-Walter algorithm, Pattern matching, Algorithm, String (physics), DFA minimization, Automaton

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A deterministic finite automata based on improved BM algorithm — Research Paper | ScholarLens