UGC NET Computer Science Q74

Question

Which of the following languages can be recognized by Non-Deterministic Finite Automata (NFA) but cannot be recognized by Deterministic Finite Automata (DFA) ?
(A) L₁={we {0, 1}* | the length of w is even}
(B) L2={we {0, 1}* | the length of w is odd}
(C) L3={we {0, 1}* | all 0's come before all 1's in w}
(D) L₄={we {0, 1}* | w contains an equal number of 0's and 1's}
(E) L₅={we {0, 1}* | all 1's come before all 0's in w}
Choose the correct answer from the options given below:

Accepted Answer

(C) and (D) Only