...
Question 10885 – Binary-Trees
November 8, 2023
Question 13880 – UGC NET JRF November 2020 Paper-2
November 8, 2023
Question 10885 – Binary-Trees
November 8, 2023
Question 13880 – UGC NET JRF November 2020 Paper-2
November 8, 2023

Question 13860 – UGC NET JRF November 2020 Paper-2

Which of the following statements is true?

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.
A
The union of two context free languages is context free.
B
The intersection of two context free languages is context free.
C
The complement of a context free language is context free.
D
If a language is context free, it can always be accepted by a deterministic pushdown automaton.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!