https://gateoverflow.in/1972/gate2014-2-16 u can find the same question here. moreover for better understanding in more simpler way you can take it as:

L(TRUE)<------L'(TRUE)

L(FALSE)--------> L'(FALSE)

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

9. Let L ≤ ML’ denote the language L is mapping reducible (many to one reducible) to language L’. Which one of the following is True?

(a) If L ≤ pL’ and L’ is semidecidable then L is semidecidable.

(b) If L ≤ pL’ and L is RE then L’ is RE.

(c) If L ≤ pL’ and L is decidable then L’ decidable.

(d) If L ≤ pL’ and L is recursive.

Solution: Option (a)

PLEASE Explain

(a) If L ≤ pL’ and L’ is semidecidable then L is semidecidable.

(b) If L ≤ pL’ and L is RE then L’ is RE.

(c) If L ≤ pL’ and L is decidable then L’ decidable.

(d) If L ≤ pL’ and L is recursive.

Solution: Option (a)

PLEASE Explain

closed as a duplicate of:
GATE2014-2-16

+1

https://gateoverflow.in/1972/gate2014-2-16 u can find the same question here. moreover for better understanding in more simpler way you can take it as:

L(TRUE)<------L'(TRUE)

L(FALSE)--------> L'(FALSE)

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 7.1k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.3k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4k
- Non GATE 1.4k
- Others 1.5k
- Admissions 559
- Exam Queries 553
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

47,913 questions

52,294 answers

182,250 comments

67,742 users