edited by
521 views
0 votes
0 votes

Consider the following NFA M , over the alphabet {a}

let L(M) be the language accepted by the NFA M .  let $M'$  denote the machine obtained by the final and non final states respect . then which of the following statement is true about L(M) and $L (M' )$

      1 ) $L (M' ) \supseteq L(M))$

      2) $L (M' ) \cap L(M)) = phi$

  1. $L (M' ) - L(M)) = phi$
  2. $L (M' ) \cup L(M)) = phi$
edited by

Please log in or register to answer this question.