226 views
0 votes
0 votes
which of the following is decidable?

a)the set of TM  whose language contains 0*

b) the set of all TM who  accept same string after visiting atmost 100 distinct Tape cell

c)set of Tm that generate same language

answer given A;

now my question is why B is not decidable???(i dont think it is same as equivalence of TM)

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
learner_geek asked Aug 15, 2017
1,375 views
Is complement of language same type or not decidable by CFL and recursive language or not???Grammar is ambiguous or not?Grammar in regular/CFL/rel decidable or not?
0 votes
0 votes
1 answer
2
monty asked Oct 28, 2016
765 views
0 votes
0 votes
0 answers
3
aambazinga asked Sep 8, 2018
422 views
How can we say that any two disjoint co-turing recognisable languages are seperable by some Decidability language?