Let an NFA be defined as (Q, Σ, δ, q0, F) where • Q = {q0, q1, q2, q3}
• Σ = {a, b}
• q0 is the start state
• F = {q1, q3}
• δ is given by
a b ε
q0 {q0, q2} {q1} ∅
q1 ∅ {q3} {q2}
q2 {q2} {q0} ∅
q3 {q1} {q0} ∅
1. Draw a diagram of this NFA.
2. Construct a DFA equivalent to this NFA following the algorithm we
saw in class.