NFA to DFA conversion
A non-deterministic finite automaton can be converted into a deterministic finite automaton using several methods, such as the powerset construction method.
This article is issued from Wikipedia - version of the 12/3/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.