##### Which one of the following is CORRECT for given Finite automaton?

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**?

- Only

I is true - Only

II is true - Both I

and

II are true - Both

I and

II are false

plz also tell what sigma* mean?????

Sigma * is the universal set or all possible strings over sigma

so i is wrong as we could have a nfa like q0 to q1 an edge with label a represent only two strings null and a...

It does not represent sigma *

ii lets take language A as null set we can represent null set with a nfa with and we know that the intersection of null set with any set is null so ii is true .

I hope only ii is true

Yes shivani that is correct answer .