Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
GATE | CS 2022 | Question 24
Which of the following statements is/are TRUE?
(A)
Every subset of a recursively enumerable language is recursive.
(B)
If a language L and its complement L are both recursively enumerable, then L must be recursive.
(C)
The complement of a context-free language must be recursive
(D)
If L1 and L2 are regular, then L1∩ L2 must be deterministic context-free
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!
Last Updated :
Share your thoughts in the comments
GeeksforGeeks