Question

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?

(a) L1 = {0, 1}* – L

(b) L1 = {0, 1}* – L

(c) L1 ⊆ L

(d) L1=L

I got this question by my college director while I was bunking the class.

This intriguing question comes from Obtaining the regular Expression from the Finite automata topic in chapter Finite Automata and Regular Expression of Compiler

Answer 1

Correct answer is (b) L1 = {0, 1}* – L

For explanation I would say: Either it takes 0 or 1 or iterations of it or none.compilers-questions-answers-Obtaining the regular Expression from the Finite autom