Awesome q2a theme
0 votes

Assertion reasoning question:

Assertion(a) : Let L is recursive enumerable language and problem X is defined as X: Is L=Φ? is not recursively enumerable

Reasoning(r): X violates the condition that says. if L is an infinite set in S, a set of recursive enumerable languages, then there is some finite subset L prime of L that is in S

Which of the following is true?

  1. Both a and r are true and r is the correct reason for a
  2. Both a and r are true, but r is not the correct reason for a
  3. a is true , r is false
  4. a is false, r is true 

Please answer with explanation

in Theory of Computation by (14 points) | 6 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jun 2020
  1. ummokkate

    8 Points

  2. nehaPal13

    7 Points

  3. Muktiyar

    6 Points

  4. Taraka

    6 Points

  5. pratyush12

    6 Points

  6. Radheram

    6 Points

  7. amare123

    6 Points

  8. vps123

    4 Points

  9. reboot

    2 Points

  10. Chinmay Agnihotri

    2 Points

7,414 questions
1,744 answers
90,375 users