in Theory of Computation
952 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}
in Theory of Computation
952 views

1 comment

5 states DFA should be minimum,

8
8

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.

1 comment

Given in question epsilon isn’t accepted. Hence 4 states aren’t enough.
0
0

Related questions