Consider the following two statements: I. If all states of an NFA are…
GATE · 2016 · CS · Set 2 · Computer Science & IT
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 such that for all languages , is regular.
Which one of the following is CORRECT?
- A.
Only I is true
- B.
Only II is true
- C.
Both I and II are true
- D.
Both I and II are false
Attempted by 190 students.
Sign up free to check your answer
Sign up freeLoading lesson…