ChatDiagram
automata theory · formal languages · subset construction

Subset Construction: NFA to DFA for Binary Strings Divisible by 3

Type State diagramStandard OMG UML 2.5.1 §14 + Harel (1987) statechartEngine schematex-stateUpdated 9/28/2026
Subset Construction: NFA to DFA for Binary Strings Divisible by 3
Drawing preview
The scenario

A duplicated NFA with an epsilon move between two identical copies of the remainder automaton is subset-constructed; the resulting DFA states are pairs like {A₀,B₀} and retain the same 0/1 transition structure.

What is in this drawing

Read the decisions behind it.

01

Use subset labels to show NFA state combinations after epsilon-closure

02

Mark the accepting DFA state with a note instead of a final sink

03

Omit unreachable empty subset to keep the diagram clean

Reuse when illustrating the subset construction algorithm for NFAs with epsilon transitions or duplicated states.

More like this

Other examples in this family.

Browse all state diagram templates →