Question: 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

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
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
