Data-Structures
November 8, 2023UGC NET JRF November 2020 Paper-2
November 8, 2023UGC NET JRF November 2020 Paper-2
| Question 5 |
Which of the following statements is true?
| The union of two context free languages is context free. | |
| The intersection of two context free languages is context free. | |
| The complement of a context free language is context free. | |
| If a language is context free, it can always be accepted by a deterministic pushdown automaton. |
Question 5 Explanation:
Option 4 is incorrect because CFL includes both DCFL and NDCFL and NDCFL are accepted by only non-deterministic pushdown automata, they can’t be accepted by Deterministic PDA.
Correct Answer: A
Question 5 Explanation:
Option 4 is incorrect because CFL includes both DCFL and NDCFL and NDCFL are accepted by only non-deterministic pushdown automata, they can’t be accepted by Deterministic PDA.