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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "recognizer", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/recognizer.html