# example :concatenation of 2 undecidable language gives a decidable language [closed]

give example of 2 languages A and B such that A and B are undecidable but there concatenation A.B is decidable.

-

## closed as too localized by Andreas Blass, Andres Caicedo, Mark Sapir, Henry Cohn, Benjamin SteinbergApr 30 '12 at 2:33

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

This looks like homework to me; I'll vote to close. –  Andreas Blass Apr 30 '12 at 0:30
Should I delete my answer? –  Joel David Hamkins Apr 30 '12 at 0:58
yes you can delete –  shreya Apr 30 '12 at 1:38

Let $A$ contain all even-length strings, plus an undecidable collection of odd-length strings. Let $B$ contain all odd-length strings, plus the empty string, plus an undecidable collection of even-length strings. So each is undecidable, but the concatenation $AB$ consists of all strings and hence is decidable.