Last Updated :
12 Dec, 2018
Consider the following languages?
- L1 = {<M> | M is a Turing machine that rejects all inputs of even length}.
- L2 = {<M> | M is a Turing machine that halts on an empty input}.
- L3 = {<M> | there is some input x ∈ {0, 1}∗ such that M accepts x in less than 100 steps}.
Then,
(A) L1 and L2 are decidable, L3 is undecidable.
(B) L1 is undecidable, L2 and L3 are decidable.
(C) L1 and L2 are undecidable, L3 is decidable.
(D) L1 is decidable, L2 and L3 are undecidable.
Answer: (C)
Explanation:
So, option (C) is correct.
Quiz of this Question
Share your thoughts in the comments
Please Login to comment...