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 (54.9k points)   | 92 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
+2 votes
1 answer
asked in Theory of Computation by monty Active (1.1k points)   | 174 views

Top Users Jun 2017
  1. Bikram

    3810 Points

  2. Arnab Bhadra

    1526 Points

  3. Hemant Parihar

    1502 Points

  4. Niraj Singh 2

    1491 Points

  5. Debashish Deka

    1434 Points

  6. junaid ahmad

    1432 Points

  7. pawan kumarln

    1278 Points

  8. Rupendra Choudhary

    1242 Points

  9. rahul sharma 5

    1236 Points

  10. Arjun

    1218 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 26 - Jul 02
  1. pawan kumarln

    410 Points

  2. Arjun

    258 Points

  3. akankshadewangan24

    254 Points

  4. Abhisek Das

    220 Points

  5. Debashish Deka

    188 Points

23,421 questions
30,139 answers
28,469 users