search
Log In
2 votes
323 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}
in Theory of Computation 323 views
6

5 states DFA should be minimum,

1 Answer

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 vote
2 answers
1
494 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 language L, then what is the number of states in M ? Is it nm or (n+1)(m+1) ?
asked Nov 2, 2017 in Theory of Computation humblefool 494 views
0 votes
3 answers
2
1.2k 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 states for this since remainders will be 8 (0,1,2,3,4,5,6,7). But the answer is 4].
asked May 8, 2018 in Theory of Computation kislaya Pant 1.2k views
1 vote
1 answer
3
548 views
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
asked Apr 8, 2018 in Theory of Computation smsubham 548 views
3 votes
1 answer
4
...