Consider the NFA M shown below. Let the language accepted by M be L. Let L₁ be…
GATE · Computer Science · 2003
Consider the NFA M shown below. Let the language accepted by M be L. Let L₁ be the language accepted by the NFA M₁, obtained by changing the accepting state and by changing the non-accepting states of M to accepting states. Which of the following statements is true?
- A.
L₁ = {0,1}* − L
- B.
L₁ = {0,1}*
- C.
L₁ ⊂ L
- D.
L₁ = L
Attempted by 137 students.
Sign up free to check your answer
Sign up freeLoading lesson…