1,391 views

1 Answer

0 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.
Position:
Show:

Related questions

2 2 votes
2 2 answers
2.5k
2.5k views
humblefool asked Nov 2, 2017
2,450 views
Suppose L is a regular language of all a's and b's where the number of a's is divisible by m and the number of b's is divisible by n. If M is the minimal DFA accepting la...
1 1 vote
3 3 answers
5.1k
5.1k views
kislaya Pant asked May 8, 2018
5,083 views
Ques:- Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)?*[ Can anybody explain this as I am getting 8 ...
1 1 vote
1 1 answer
1.9k
1.9k views
kislaya Pant asked May 8, 2018
1,893 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 1 vote
1 1 answer
3.6k
3.6k views
smsubham asked Apr 8, 2018
3,565 views
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?