Which of the following option is True?
(A) If L is a context free language without null production then there is grammar in Chomsky Normal Form that generates L.
(B) If L ≠ ∅ and L is regular then L is the union of regular language A1, . . . , An where each Ai is accepted by a DFA with exactly one final state.
(C) Both (A) and (B) are correct.
(D) None of these


Answer: (C)

Explanation: Both (A) and (B) are correct. These are Lemmas of Chomsky Normal Form theorem.

Option (C) is true.

Quiz of this Question