Question 9742 – Theory-of-Computation
December 6, 2023Question 9744 – Theory-of-Computation
December 6, 2023Question 9743 – Theory-of-Computation
Which of the following statements is true?
Correct Answer: B
Question 48 Explanation:
Context free languages closed under Union, concatenation and kleen star. But not close under intersection and complementation.
If a language is context free it can always be accepted by a deterministic push-down automaton
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
Subscribe
Login
0 Comments