953 views
2 votes
2 votes
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}

1 Answer

0 votes
0 votes
4 should be the minimum number of states: (even, even) which is final and starting state denoting zero a and b. (even, odd) for even a and odd b. (odd, even) for odd a and even b. (odd,odd) for odd a and odd b.

Make appropriate transitions.

Related questions

1 votes
1 votes
1 answer
3
kislaya Pant asked May 8, 2018
1,108 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)....
1 votes
1 votes
1 answer
4
smsubham asked Apr 8, 2018
2,656 views
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?