michael sipser chp 1, 3rd edition, Q 12 , dfa

Question

let D= {w | w contains an even no. of a's and an odd no. of b's and does not contain the substring ab }

give a DFA with Five states that recognizes D and a regular expression that generates D.

Answer 1

Let me know if i am wrong :)

Comments

how will it accept the string "aa" ? u forgot the connecting line of that state.

---

question says even a's "and" odd b's and no 'ab'  so there is no 'aa' in the langauage

---

ok now i got it.. thank you so much :)

Answer 2

minimal  dfa will also have 5 states

Answer 3

please correct me if I am wrong