In: Computer Science
Please provide detailed solutions for the following problems.
1. Convert the NFA defined by
δ (q0; a) = {q0; q1}
δ (q1; b) = {q1; q2}
δ (q2; a) = {q2}
with initial state q0 and final state q2 into an equivalent DFA.
2. Convert the NFA defined by
δ (q0; a) = {q0; q1}
δ (q1; b) = {q1; q2}
δ (q2; a) = {q2}
δ (q0; λ) = {q2}
with initial state q0 and final state q2 into an equivalent DFA.
3. Convert the NFA defined by
δ (q0, a) = {q0; q1}
δ (q1, b) = {q1; q2}
δ (q2, a) = {q2}
δ (q1; λ) = { q1; q2}
with initial state q0 and final state q2 into an equivalent DFA