Draw DFA

Question

Plz somebody draw DFA for following regular expression:

r=(1+10)^*

Comments

Detailed explanation too along with DFA

Answer 1

Given Language is accepting all the strings which is not start with 0 and not having 2 consecutive 0's.

So, it can ∈ and 1 because both are not starting with 0.

L={∈,1,10,101,11,111................}

Here any string which is start with 0 and having consecutive will lead to dead state q3

Comments

are you taking about your solution?

---

no it is reply to  Devshree Dube

---

Actually the prob tat I m facing is tat if any regular expression is given I face prob in drawing its DFA. Like u've drawn three final states. How does one decide on this?

Answer 2

(1+10) means we will reach final state either by 1 or by 10 now its star closure is given which includes empty string means initial state is also final state . and any amount of repetition of either 1 or 10 will also take to final state and even 1 followed by 10 or 10 followed by1 (any no of times) will also take us to final state hence its DFA should be like 

Comments

Thank you for the answer Sir. But one doubt still exists, why in 1st state there is a zero to the initial state.

---

it is not zero it is actually final state and i left the rejected state

---

Sanjay Sharma Question asking for Dfa not for nfa.