1,292 views
0 votes
0 votes
let l be a language and l={w|w has exactly one b ,w belongs to {a,b}*,|w| is even}

minimum number of states in minimized dfa?????

2 Answers

Best answer
2 votes
2 votes

5 is the correct answer. here is the dfa 

selected by
0 votes
0 votes

fto draw the dfa :

requirements : exactly one b. and |w|=even.

so regular expresion (nfa)= (aa)*a(b)(aa)* + ((aa)*(b)a(aa)*)

                                        = (aa)*(ab+ba)(aa)*

i have drawn dfa directly hope it helps : q3 is final state .

Related questions

3 votes
3 votes
1 answer
1
abhinowKatore asked Jan 14, 2023
530 views
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
0 votes
0 votes
1 answer
4
Deepalitrapti asked Jun 6, 2019
262 views