L1 is accepted by the NFA, obtained by changing the accepting state of M to a non-accepting state and vice versa. Which of the following statements is true?

L1 is accepted by the NFA, obtained by changing the accepting state of M to a non-accepting state and vice versa. Which of the following statements is true? Correct Answer L1 = {0, 1}* – L

Either it takes 0 or 1 or iterations of it or none.compilers-questions-answers-Obtaining the regular Expression from the Finite automata

Related Questions

Statement 1: NFA computes the string along parallel paths. Statement 2: An input can be accepted at more than one place in an NFA. Which among the following options are most appropriate?