TOC

Question

What wud be THE DFA for the following expression ?

0*1* + 1*0*

Answer 1

So as we can see we have an NFA for the given regex. Try to apply the following three algorithms to get the desired result.

1.  Removal of $\epsilon$ moves to obtain $\epsilon$ free NFA.
2.  NFA to DFA conversion.
3.  DFA minimization.

Give it a try. If you are not sure with what you obtain, share it as an edit to your question.

---

EDIT

Here I see my approach was not really appreciated. So here is an equivalent DFA - 

P.S This isn't minimized DFA.

HTH

Comments

well Your DFA when will be minimzed will be like this only if i have not done any silly mistake anywhere ?

---

LavTheRawkstar 

[S,A,C] [B] [D] [E] states are 1 equivalent.

now you have to find 2 equivalent states.

[S] [A] [B] [C] [D] [E]   -> 2 equivalent states 

---

tried online tool to understand this, but even NFA is very big. See this