Awesome q2a theme
0 votes
9 views

What are the languages, RE or not RE? 

Please explain using Rice’s theorem or otherwise.

 1)  L={⟨M⟩|TM halts on empty string}

 2)  L={⟨M⟩|TM halts on empty string}

 3)  L={⟨M⟩|TM halts on no input}

Not sure how rice’s theorem is working here. 

ago in Theory of Computation by (8 points) | 9 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
Top Users 2020 Aug 03 - 09
  1. Ashutosh07091999

    18 Points

  2. Mellophi

    13 Points

  3. prashastinama

    6 Points

  4. manas_kulkarni

    4 Points

  5. srestha

    2 Points

  6. Unnayan kumar

    1 Points

  7. aryashah2k

    1 Points

  8. Jhaiyam

    1 Points

  9. prabhat0987

    1 Points

  10. Kushagra गुप्ता

    1 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Aug 2020
  1. Ashutosh07091999

    21 Points

  2. Mellophi

    19 Points

  3. Unnayan kumar

    8 Points

  4. Sourav Kar

    7 Points

  5. anurag_yo

    7 Points

  6. Shaik Masthan

    7 Points

  7. prashastinama

    6 Points

  8. sureshthiyam

    6 Points

  9. manas_kulkarni

    6 Points

  10. srestha

    4 Points

7,688 questions
1,815 answers
11,053 comments
95,077 users