543 views
0 votes
0 votes
Construct a minimal DFA which accepts set of all strings over {a,b}, such that

$1)$Second symbol from $RHS$ should be $‘a’$

$2)$Third symbol from $RHS$ should be $‘a’$

1 Answer

Best answer
1 votes
1 votes

2nd part AND 1st part.

 

selected by

Related questions

1 votes
1 votes
2 answers
1
Shivani gaikawad asked Jun 5, 2018
916 views
The minimum number of state in the DFA for the language $L = \{ w \mid (n_a(w)+2n_b(w))mod \hspace{0.1cm} 3<2 \} $ is
0 votes
0 votes
2 answers
2
Shivani gaikawad asked Jun 5, 2018
438 views
The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$$10$$16$None
2 votes
2 votes
1 answer
3
rahul sharma 5 asked Nov 9, 2017
936 views
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
5 votes
5 votes
3 answers
4
Manu Thakur asked Oct 9, 2017
2,125 views
I think, there will be 4 states in minimum DFA, following states will be merged in the resulted DFA{q0&q3}, {q4&q5}, {q1&q6}, {q2&q7}