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 (53.1k points)   | 80 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
1 answer
+1 vote
1 answer
asked in Theory of Computation by monty Active (1.1k points)   | 169 views

Top Users Apr 2017
  1. akash.dinkar12

    3796 Points

  2. Divya Bharti

    2716 Points

  3. Deepthi_ts

    2294 Points

  4. rude

    2142 Points

  5. Tesla!

    1888 Points

  6. Kapil

    1786 Points

  7. Sanjay Sharma

    1702 Points

  8. Debashish Deka

    1690 Points

  9. Prashant.

    1672 Points

  10. Arjun

    1614 Points

Monthly Topper: Rs. 500 gift card

22,149 questions
28,146 answers
24,309 users