Minimum number of states

Question

$R= 10 +(0 +11)0^{*}1.$

The minimum number of states in any DFA accepting this regular expression.

Answer 1

5 states DFA will be minimal,

Comments

@joshi_nitish

It's ok :)

But this should not be the best answer now otherwise will create confusion to others.

---

try this for better graphics-:

http://madebyevan.com/fsm/

---

@sourav.

thankyou!! next time i will try it.

Answer 2

$5$ STATES

Comments

Yes exactly what I was saying why should 6 be the answer if we can merge both final states.

---

yeah  i got it, it should be 5