Context free language – Theory of Computing
|Question 1 UGC NET June-2020 |
Which of the following statements is true?
|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.|