Request New Subject
Home
Computer Science Engineering (CSE)
Theory of Computation and Compiler Design
Q. If L and L' are recursively enumerable, then L is (Solved)
1. regular
2. context free
3. context sensitive
4. recursive
d. recursive
Related Topics
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Data Structure and Algorithms (DSA)
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ High Performance Computing (HPC)
→ Data Communication and Computer Network
Subscribe Now
Get All Updates & News
Subscribe