edited by
895 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

Related questions

1 votes
1 votes
1 answer
3
kislaya Pant asked May 8, 2018
1,105 views
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
3 votes
3 votes
1 answer
4