(definition)
Definition: If a finite state machine finishes an input string and is in an accepting state, the string is accepted or considered to be valid.
See also recognizer.
Note: A machine may enter an accepting state, then leave it. Acceptance depends on whether the machine finishes in an accepting state.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:01:58 2004.
HTML page formatted Wed Oct 26 09:47:07 2005.
Cite this as:
Paul E. Black, "accepting state", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/acceptingstt.html
