Consider the following two statements: I. If all states

Home » Theory of Computation » Theory of computation miscellaneous » Question

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?

1. Only I is true
2. Only II is true
3. Both I and II are true
4. Both I and II are false

Correct Option: B

Statement I is not true, because if all the states of DFA are accepting states then the language accepted by the DFA is * å Statement II is true because one can have regular language A = [] [Empty Language] which satisfies the given condition.