GATE CSE
First time here? Checkout the FAQ!
x
0 votes
123 views
Let A = {<M>|M is a TM and L(M) is regular}. Then A is _________

a) Decidable language and regular language

b) Undecidable but partially decidable

c) Totally not decidable

d) Decidable language but not regular language
asked in Theory of Computation by Veteran (65.1k points) 35 222 627 | 123 views
I think C, since we can take one Tyes = a and Tno = a^nb^n .Then Tyes subset of Tno.Hence not even R.E.

1 Answer

0 votes
Option B. According to Rice's theorem, anything non-trivial is undecidable. This is partially decidable, suppose the TM accepts a regular language, we can test this by passing all regular strings one after another, sooner or later the TM is going to stop by accepting it because it accepts reg language. This process can be fastened by using dovetailing technique i.e processing n strings parallely. But suppose the given TM doesn't accept regular language then the TM would be running forever checking every regular string. Thus it is partially decidable.
answered by Active (1.5k points) 2 12 21


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 Oct 2017
  1. Arjun

    23462 Points

  2. Bikram

    17108 Points

  3. Habibkhan

    8560 Points

  4. srestha

    6314 Points

  5. Debashish Deka

    5458 Points

  6. jothee

    5038 Points

  7. Sachin Mittal 1

    4882 Points

  8. joshi_nitish

    4416 Points

  9. sushmita

    3996 Points

  10. Rishi yadav

    3868 Points


Recent Badges

Notable Question Sanjay Sharma
Notable Question Warrior
Notable Question sid1221
Nice Answer 2018
Good Question Arjun
Nice Question mitalitak
Great Question Arjun
Popular Question Tesla!
Nice Question makhdoom ghaya
Popular Question Sankaranarayanan P.N
27,348 questions
35,204 answers
84,249 comments
33,328 users