Question 1

What is the NFA to DFA Subset Construction Algorithm?

Accepted Answer

The subset construction algorithm (or powerset construction) converts a Nondeterministic Finite Automaton (NFA) into a Deterministic Finite Automaton (DFA) by grouping sets of NFA states into single DFA states.

Question 2

How does epsilon-closure (ε-closure) work?

Accepted Answer

An epsilon closure of an NFA state is the set of all states reachable from that state by following only zero or more epsilon (empty string) transitions.