GATE CSE
First time here? Checkout the FAQ!
x
0 votes
106 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 (56.7k points)   | 106 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.2k points)  

Related questions

0 votes
3 answers
1
+2 votes
1 answer
2
asked in Theory of Computation by monty Active (1.1k points)   | 189 views


Top Users Aug 2017
  1. Bikram

    5276 Points

  2. ABKUNDAN

    4730 Points

  3. akash.dinkar12

    3526 Points

  4. manu00x

    3492 Points

  5. rahul sharma 5

    3188 Points

  6. makhdoom ghaya

    2700 Points

  7. just_bhavana

    2432 Points

  8. stblue

    2244 Points

  9. Tesla!

    2090 Points

  10. pawan kumarln

    1876 Points


25,074 questions
32,230 answers
75,116 comments
30,239 users