Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer? - EduRev Computer Science Engineering (CSE) Question

Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity

Open App

Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider the NFA M shown below.Q. Let the lan...

Join the Discussion on the App

Consider the NFA M shown below.

Q. 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 ⊆ L
d)
L1 = L

Correct answer is option 'B'. Can you explain this answer?

FREE This question is part of

Test: Regular Expressions & Finite Automata- 2

Attempt Test

Attempt this Test

Verified Answer

Consider the NFA M shown below.Q. Let the language accepted by M be L....

In case of a Deterministic Finite Automata (DFA) when we change the accepting states into non-accepting states and non-accepting states into accepting states, the new DFA obtained accepts the complement of the language accepted by the initial DFA. It is because we have one single movement for a particular input alphabet from one state so the strings accepted by the transformed DFA will be all those which are not accepted by the actual DFA.

But it is not the case with the NFA’s (Non-Deterministic Finite Automata). In case of NFA we need to have a check on the language accepted by the NFA. The NFA obtained by changing the accepting states to non-accepting states and non-accepting states to accepting states is as follows:-

Here we can see that as i. The initial state is an accepting state hence null string is always accepted by the NFA. ii. There is a movement from state 1 to state 2 on both {0, 1} input alphabets and further any number of 1’s and 0’s or even none in the string lets the string be at an accepting state(state 2).

Hence the language accepted by the NFA can be any string with any combination of 0’s and 1’s including a null string i.e. {null, 0, 1, 00, 01, 10, 11,……………..} so L1= {0, 1}*.

View all questions of this test

View all answers Start learning for free

< Previous Question Next Question >

Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

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 states of M to accepting states.Which of the following statements is true?

View answer

Consider the non-deterministic finite automaton (NF

View answer

Consider the following two statements:I. If all states of an NFA are accepting states then the language accepted by the NFA is .II. There exists a regular language A such that for all languages B, A B is regular.Q.Which one of the following is CORRECT?

View answer

Consider the following problems L(G) denotes the language generated by a grammar G.L(M) denotes the language accepted by a machine M.(I) For an unrestricted grammar G and a string w, where w = L(G).(II) Given a Turing Machine M, whether L(M) is regular.(III) Given two grammars G1 and G2 whether L(G1) = L(G2).(IV) Given an NFA N, whether there is a deterministic PDA P such that N and P accept the same language.Which one of the following statements is correct?

View answer

Which of the following assertion is false?

View answer

Top Courses for Computer Science Engineering (CSE)View all

GATE Computer Science Engineering(CSE) 2025 Mock Test Series

Question Bank for GATE Computer Science Engineering

General Aptitude for GATE

Computer Networks

Programming and Data Structures

Top Courses for Computer Science Engineering (CSE)

View all

Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer?

Share with a Friend

Answer this doubt

Question Description
Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer?.

Solutions for Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.

Here you can find the meaning of Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer?, a detailed solution for Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer? has been provided alongside types of Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider the NFA M shown below.Q. 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}* - Lb)L1 = {0, 1}*c)L1 ⊆ Ld)L1 = LCorrect answer is option 'B'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.

Explore Courses for Computer Science Engineering (CSE) exam