#TOC What will be the minimal DFA of this regular language?

Question

Given L = { 0*1 + 0 + 1* + 10*1}

where + symbol is UNION and NOT positive closure.

Please draw the Minimal DFA for this.

Comments

Yes bro,
Language contain 1* = null, 1,11...

---

haan bhai.. 1* epsilon,1,11,111,..dega to sabhi ka union  karne ke baad epsilon language me hoga..

---

Thanks both of you, very much appreciated. 🙏

Answer 1

HI is this dfa fine>??

Comments

$\varepsilon$  should also be accepted..

Answer 2

https://drive.google.com/open?id=11ROM-L9EOewQutW-M4qiMmv7wd1pGtLl

Comments

01 is rejected in your dfa.

6 states is what i am getting.correct me if i am wrong.

D is dead state A is starting state ,states with(*) are final states.

	0	1
->A*	B*	E*
B*	B*	C*
C*	D	D
E*	B*	F*
F*	D	F*

 

---

00 is not generate by the regular expression,but the table you've given is accepting it.

---

Thanks for pointing out the error. I think if we just add a transition of 1 from B to F , it will work fine.