M

Mr. Dubey • 100.69K Points
Coach

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
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. What do you mean by a hard margin?

Q. In TDM, slots are further divided into

Q. Which of the following Choices and standardizes patterns for a problem domain promotes software reuse and, hence, quality and productivity?

Q. A random access machine (RAM) and truing machine are different in

Q. Following acts as detector in Optical sensor

Q. A large collections of files are called

Q. Which one of the following protocol is not used in internet?

Q. Python supports the creation of anonymous functions at runtime, using a construct called

Q. Risk monitoring process

Q. The application of OR techniques involves ………… approach

Question analytics