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?

Home / Engineering / Theory of Computation / Question

Mr. Dubey • 51.17K 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}*

(D) L1 = L

Correct answer : Option (A) - L1 = {0,1}* − L

Discusssion

Related MCQs on Theory of Computation

Q. SQL outputs a single table known as the ______:

Q. To access the services of operating system, the interface is provided by the

Q. Conversion of fractional number 0.6875 into its equivalent binary number:

Q. Which of the following is not used in measuring the size of the software

Q. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

Q. Allowing multiple instructions for issuing in a clock cycle, is the goal of

Q. AIDC stands for

Q. Redundancy has to be implemented at the architectural level for effective results in cloud computing.

Q. The project planner must reconcile the estimates based on decomposition techniques to produce a single estimate of effort.

Q. The circuits of NOR based S-R latch classified as asynchronous sequential circuits, why?