deterministic finite automata string search

(algorithm)

Definition: A string matching algorithm which builds a deterministic finite state machine to recognize the search string. The machine is then run at each location in turn. If the machine accepts, that is a match.

Author: PEB

Implementation

description and animation (C), (C) which uses a finite automaton structure (C) and builds a recognizer (C)

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 30 September 2009.
HTML page formatted Wed Sep 30 13:22:29 2009.

Cite this as:
Paul E. Black, "deterministic finite automata string search", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 30 September 2009. (accessed TODAY) Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/determFinitAutSrch.html