Finite State Automaton String Matching Algorithm
Jump to navigation
Jump to search
A Finite State Automaton String Matching Algorithm is an Exact String Matching Algorithm that uses a Finite State Automaton.
References
- (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Finite-state_machine