TGPSC HMWSSB Manager 2015 Paper 2 CSE · Question 69
Question 69 of the TSPSC Manager (Engineering), HMWSSB, 2015: Paper 2 (Computer Science & Information Technology) (1 November 2015). Try it first, then open the answer. The explanation is in the practice app with the All-in-One Pass.
Which of the following statements is incorrect?
- Every recursively enumerable language is recursive
- The union of two recursively enumerable languages is recursively enumerable
- The union of two recursive languages is recursive enumerable language
- If the language L and it's complement L' are recursively enumerable then L is recursive
Show answer
Answer: (1) Every recursively enumerable language is recursive
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.