NFA → DFA

The subset construction: every set of NFA states the machine could be in becomes one DFA state.

Hopcroft 2e, §2.3.5 (and §2.5.5 for an ε-NFA)

Machine

Source · NFA

fixed

1 of 3 states

1 row

The subset table. Each row is a DFA state; each cell is where it goes on that symbol.
DFA state	0	1
{q0}	—	—

Start from the subset containing just the start state: {q0}. That subset is the start state of the DFA.

The answer appears at the last step. if you would rather read it than watch it.

How to read itHopcroft 2e, §2.3.5 (and §2.5.5 for an ε-NFA)

The table underneath is the subset table, one row per DFA state.
A row is expanded per step: where it goes on each symbol, and which of those subsets are new.
The DFA on the right grows a state at a time — only subsets that are actually reachable are built.