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.Which one of the following is CORRECT?

Question

Examsnet · Accepted Answer

Correct Answer is : Only II is true

GATE Computer Science (CS) 2016 Shift 2 Solved Paper