michael sipser Chapter 1, 3rd edition, question8 a , regular languages

Question

give the state diagram of NFAs recognizing the union of the following languages

a.) {w |w begins with a 1 and ends with a 0 }

b.} {w | w contains at least three 1s }

This is how i have solved it. is this correct ?

Comments

yes! this is correct.

---

thank you so much

---

anu..i think u r correct but try to minimize the no. of states if possible