Link to home
Start Free TrialLog in
Avatar of Mr_Lee
Mr_Lee

asked on

Undecidable Language

This is a practice problem. I have a Turing Machine M, determine if L(M) = {you, are, very, welcome}. Formulate this as a language and show that it is undecidable (hint: using reduction which is similar to Empty, Regular, and Size-2 language problems).
Avatar of TommySzalapski
TommySzalapski
Flag of United States of America image

It doesn't look undecidable yet to me. Is there more to the problem definition than that?
Avatar of Mr_Lee
Mr_Lee

ASKER

That's all. However, I restate the hint: use a similar reduction as in the Empty, Regular, and Size-2 language problems.
Oh, I get it. The language accepts 4 strings. I'll refine the hint. Size-2 says that a language that acceps 2 strings is undecidable. So what about 4 strings?

Also, since regular languages are undecidable, you could just show (without any reductions) that L(M) is regular.
Avatar of Mr_Lee

ASKER

So 4-strings will be the union of the two size-2's. And regular language is closed under union. I did not get your last statement? L(M) is regular itself. You mean I have to show it is regular?
ASKER CERTIFIED SOLUTION
Avatar of TommySzalapski
TommySzalapski
Flag of United States of America image

Link to home
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Start Free Trial