Theory of Computation

Q8.a. Section 3.2 Question 6a : Find dfa that accepts: L(aa+abab) 1. Draw the nfa 2. Convert the nfa to a dfa 3. Reduce the number of states in the dfa po [q0q1q3] p1 {q244] p2[q2] p3[q5q6] p4{q6} p52 Q8.a. Section 3.2 Question 6a: Find dfa that accepts: 4(aa+abab) 1. Draw the ofa. 2. Convert the nfa to a dfa 3. Reduce the number of states in the dfa This dfa cannot be reduced