Consider the following statements:
(I) For some regular language there exists an FA with exactly one final state.
(II) For every regular language there exists a DFA with exactly one final state.
(III) If a language satisfies pumping lemma for regular languages then it is regular.
(IV) Type-3 grammars generate regular language.
(V) All finite languages are regular.
Which of the above statement/s is are TRUE?
1
(I), (III), (IV), (V) only
2
(III), (IV), (V) only
3
(I),(IV),(V) only
4
(IV), (V) only