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} Theory of Computation theory-of-computation finite-automata minimal-state-automata number-of-states + – rahul sharma 5 asked Nov 9, 2017 rahul sharma 5 952 views answer comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Nov 9, 2017 reply Follow Share 5 states DFA should be minimum, 8 votes 8 votes Please log in or register to add a comment.
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. Gupta731 answered Oct 12, 2018 Gupta731 comment Share Follow See 1 comment See all 1 1 comment reply Shiva Sagar Rao commented Jan 31, 2021 reply Follow Share Given in question epsilon isn’t accepted. Hence 4 states aren’t enough. 0 votes 0 votes Please log in or register to add a comment.