상황
Converting the regular expression (a|b)*abb to a DFA using subset construction. The DFA states A–D correspond to NFA state subsets, and D is the accepting state because it contains q3.
이 도면에 담긴 내용
그 이면의 의사결정을 읽어 보세요.
01
Start with subset {q0} as initial DFA state A.
02
On 'a' from A include q1 to form B = {q0,q1}.
03
On 'b' from B include q2 to form C = {q0,q2}.
04
On 'b' from C include q3 to form accepting D = {q0,q3}.
05
Keep accepting state D as a normal state with outgoing transitions, not a final sink.
Use for teaching NFA-to-DFA conversion and for verifying automata for regex that include closure followed by a suffix.