NFA→DFA Studio

Subset construction, minimization and simulation for finite automata

NFA

Input automaton

ε-movecurrentresult
Drag states to rearrange
DFA

The subset construction starts from the ε-closure of the NFA's start state. For every new DFA state T and every symbol a, it computes ε-closure(move(T, a)). Each new subset becomes a new DFA state. Step through it and watch both diagrams.

0 / 0

Keyboard: ← → to step, Space to play or pause. Expand a diagram to present it full screen.