in Theory of Computation edited by
884 views
0 votes
0 votes
Let L1  = $0^+1^+$ and L2 = $(01)^+$, $L3 = \frac{L1}{ L2^*}$. The number of state needed for minimal DFA are _____.
in Theory of Computation edited by
884 views

1 Answer

3 votes
3 votes

we have L1 = { 01,001,011,0011.................}

              L2= {ε, 01,0101,010101.....................}

 now using right quotient : L1/L2 

            = { 01/ε, 001/ε,011/ε ,01/01 , 001/01, 0001/01............, 011/01, 0011/01..........}

            = { 01,001,011,.....ε , 0 , 00 , 000, ................................. ϕ , ϕ    }

            = { 0 * } + 0+1+

the Dfa will have 4states q0 =  intial and final state both , q1,q3 = final states ,dead state.

answer : 4states.

    

edited by
by

2 Comments

bro $\Large \frac{L_1}{(L_2)^*}$ and not $\Large \frac{L_1}{L_2}$
0
0
oopsie yes :) thanks a lot :) see now.
0
0

Related questions