2
$\begingroup$

For any language $L$ over $\{0,1\}^*$, a language $L'$ can be defined as $\{ a | ab \in L \text{ for some } b \in \{0,1\}^* \}$.

If $L$ is decidable, is $L'$ decidable?

I think that $L'$ should be decidable because we can create a Turing machine for $L'$ that will run the decider for $L$ on the input $w$ for $L'$, accept if it accepts, and otherwise will enumerate all the possible strings $b$ and run $wb$ on $L$. Does that make sense?

$\endgroup$
2
  • $\begingroup$ How do you check if w is not in L'? There are infinitely many possible suffixes (in general case). $\endgroup$ Feb 20, 2013 at 19:10
  • $\begingroup$ Hmm, I guess I can't do that then. If that's the case, it should be undecidable and I should be able to reduce some undecidable problem to it right? $\endgroup$
    – Jay
    Feb 20, 2013 at 20:33

1 Answer 1

2
$\begingroup$

Pick some self-terminating encoding of Turing machines. (That means that the encoding of one Turing machine is never a prefix of the encoding of another.) Consider the language $L$ consisting of strings $Mn$, where $M$ is an encoded Turing machine, $n$ is interpreted as a number, and $M$ halts within $n$ steps (on the empty input).

Does that answer your question?

$\endgroup$
2
  • $\begingroup$ I'm not sure I follow. L can be any language over {0,1}* so wouldn't this L you create only apply to one case? $\endgroup$
    – Jay
    Feb 20, 2013 at 20:35
  • $\begingroup$ In my example $L$ is decidable but $L'$ is not. $\endgroup$ Feb 20, 2013 at 21:35

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.