(definition)
Definition: A finite state machine whose transition function maps inputs symbols and states to a (possibly empty) set of next states. The transition function also may map the null symbol (no input symbol needed) and states to next states.
Also known as NFA, nondeterministic finite automaton.
See also deterministic finite state machine.
Note:
Any such machine may be converted to a deterministic finite state machine, although the number of states may increase by an exponential amount. Thanks to Thorsten Jens (thojens@gmx.de) and Yaacov Yesha (yayesha@cs.umbc.edu) for correcting this entry. 17 January 2001.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:53:19 2004.
HTML page formatted Wed Oct 26 09:47:51 2005.
Cite this as:
Paul E. Black, "nondeterministic finite state machine", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/nondetermFiniteStateMach.html
