Suppose we have a DFA D Q sigma delta q0 F and know that D

Suppose we have a DFA D = [Q, sigma, delta, q_0, F) and know that D accepts every string. What can we infer about D ? There is at least 1 final state in D that is not q_0 Every reachable state from Qq \'n D is a final state. There is only 1 character in the alphabet. O Every state in D is a final state. There is at least 1 state in D that is not final

Solution

Its answer is

There is atleast one state in D and that is not final this is because it accepts all strings so if there is only one state and it is final then it will not be able to accept all the strings.

if we have a string of 0\'s and 1\'s then also there will be two states and one of them will be final but if there is one state suppose 0 state then that state cannot be a final state as if that state beomes final then it will not be able to accept strings with 1.