The scenario
An NFA with epsilon transitions is converted to an equivalent DFA using subset construction. This diagram shows the deterministic state machine where each state is a set of NFA states.
What is in this drawing
Read the decisions behind it.
01
Start with ε-closure of the NFA start state
02
Include a dead state ∅ for undefined transitions to keep the DFA complete
03
Mark states containing an NFA accept state as accepting using notes rather than final pseudo-states
Use when transforming a non-deterministic finite automaton with ε-transitions into a deterministic one for simulation, minimization, or regex matching.
More like this