Subset construction with epsilon transitions
= Subset construction with epsilon transitions
The subset construction converts an epsilon-NFA into a <deterministic finite automaton>. Its states are subsets of NFA states, its initial state is the <epsilon closure> of the NFA initial state, and every symbol transition is followed by another epsilon closure.