First time here? Checkout the FAQ!
0 votes
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 (52.4k points)   | 73 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

+1 vote
1 answer
asked in Theory of Computation by monty Active (1.1k points)   | 160 views

Top Users Mar 2017
  1. rude

    4768 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2910 Points

  4. Kapil

    2732 Points

  5. Debashish Deka

    2502 Points

  6. 2018

    1544 Points

  7. Vignesh Sekar

    1422 Points

  8. Akriti sood

    1322 Points

  9. Bikram

    1290 Points

  10. Sanjay Sharma

    1106 Points

Monthly Topper: Rs. 500 gift card

21,502 questions
26,826 answers
23,126 users