NFA to DFA conversion
From HandWiki
Revision as of 07:46, 8 March 2021 by imported>S.Timg (fix)
Redirect page
Redirect to:
 | This article does not cite any external source. HandWiki requires at least one external source. See citing external sources. (December 2016) (Learn how and when to remove this template message) |
A non-deterministic finite automaton can be converted into a deterministic finite automaton using the powerset construction method, the trap state is used for the false output.
