689 views
5 votes
5 votes
Consider the following languages
 
L1={<M>∣M is a single tape TM that on any input x does not change the input portion of the tape}
 
L2={<M>∣M is a single tape TM that on any input x does not change any portion of the tape}
 
Which of the following is correct?
 
 
A.) L1 is decidable but L2 is undecidable
 
 
B.) L1 is undecidable but L2 is decidable
 
 
C.) Both L1 and L2 are decidable
 
 
D.) Both L1 and  L2 are undecidable

Please log in or register to answer this question.

Related questions

2 votes
2 votes
0 answers
2
hem chandra joshi asked Nov 14, 2017
342 views
"A regular expression denoting a language (set of strings) means it should generate all string in L and not generate any string not in L"L is set of all strings not conta...