Home / Engineering / Theory of Computation / Question


Mr. Dubey • 51.17K Points

Q.) Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true?

(A) L1 = {0,1}* − L
(B) L1 = {0,1}*
(C) L1 is a subset of L
(D) L1 = L
Correct answer : Option (A) - L1 = {0,1}* − L



Login to discuss.