627 views
0 votes
0 votes
Find minimal states in DFA accepting {w1aw2, |w1| = 2, |w2| >=3, w1,w2 $\in$ $(a+b)^*$}?

Is it $7$ or $8$?

3 Answers

Best answer
3 votes
3 votes
There will a total of 8 states

1 for start
2 for w1 language ie 1st 2 elements
1 for 'a'
3 for w2 language ie next 3 elements min
1 for dead or trap stage

Total = 8 states
selected by
3 votes
3 votes
8 is the answer . it is dfa

there must be a trap state
1 votes
1 votes

Here is the dfa. In dfa we need to define the transition for every alphabet at every state otherwise it will not be a dfa.

No related questions found