(definition)
Definition: A finite state machine with one or more states designated as accepting states. An input string is accepted if there is a path from the start state to an accepting state.
See also deterministic finite state machine, nondeterministic finite state machine.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:07:04 2004.
HTML page formatted Wed Oct 26 09:48:03 2005.
Cite this as:
Paul E. Black, "recognizer", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/recognizer.html
