in Theory of Computation
589 views
0 votes
0 votes
Given L = { 0*1 + 0 + 1* + 10*1}

where + symbol is UNION and NOT positive closure.

Please draw the Minimal DFA for this.
in Theory of Computation
by
589 views

4 Comments

Yes bro,
Language contain 1* = null, 1,11...
0
0
haan bhai.. 1* epsilon,1,11,111,..dega to sabhi ka union  karne ke baad epsilon language me hoga..
0
0
Thanks both of you, very much appreciated. 🙏
1
1

2 Answers

0 votes
0 votes

HI is this dfa fine>??

1 comment

$\varepsilon$  should also be accepted..
0
0
0 votes
0 votes

3 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*

 

1
1
00 is not generate by the regular expression,but the table you've given is accepting it.
0
0
Thanks for pointing out the error. I think if we just add a transition of 1 from B to F , it will work fine.
0
0