ChatDiagram
automata theory · formal languages · subset construction

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

유형 상태 다이어그램표준 OMG UML 2.5.1 §14 + Harel (1987) statechart엔진 schematex-state업데이트됨 2026. 9. 28.
Subset Construction: NFA to DFA for Binary Strings Divisible by 3
Drawing preview
상황

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.

이 도면에 담긴 내용

그 이면의 의사결정을 읽어 보세요.

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.

모든 상태 다이어그램 템플릿 보기 →