COCOMO-Model
October 17, 2023NTA-UGC-NET 2021 Dec & 2022 June Paper-2
October 17, 2023GATE 2005-IT
| Question 4 |
Let L be a regular language and M be a context-free language, both over the alphabet Σ. Let Lc and Mc denote the complements of L and M respectively. Which of the following statements about the language if Lc ∪ Mc is TRUE?
| It is necessarily regular but not necessarily context-free. | |
| It is necessarily context-free. | |
| It is necessarily non-regular. | |
| None of the above. |
Question 4 Explanation:
Context-free languages not closed under complementation. So, Lc ∪ Mc is neither regular nor context-free. It might be context sensitive language.
Correct Answer: D
Question 4 Explanation:
Context-free languages not closed under complementation. So, Lc ∪ Mc is neither regular nor context-free. It might be context sensitive language.
Subscribe
Login
0 Comments