Solved

Consider the NFA M Shown Below

Question 30

Multiple Choice

Consider the NFA M shown below.
Consider the NFA M shown below. Let the language accepted by M be L. Let L<sub>1</sub> 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) L<sub>1</sub> = {0,1}* ? L B) L<sub>1</sub> = {0,1}* C) L<sub>1</sub> is a subset of L D) L<sub>1</sub> = L 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

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q25: The …………. is said to be ambiguous

Q26: Which of the following problems is undecidable?<br>A)Membership

Q27: The regular expression 0*(10)* denotes the same

Q28: Which of the following strings is not

Q29: Let P be a regular language and

Q31: Which one of the following statement is

Q32: A language is represented by a regular

Q33: Which of the following regular expression identity

Q34: The minimum state automaton equivalent to the

Q35: Consider the following CFG S ? aB