Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization of DFA?
(a) 3
(b) 2
(c) 1
(d) 4
I got this question in semester exam.
The doubt is from DFA Processing Strings in portion Finite Automata of Automata Theory