Computer Science, asked by puneet251202, 3 months ago

Let L be an infinite language. Prove the following statements.
(a) If there exists a decidable K s.t.
“x is in L iff there exists a y s.t. (x,y) is in K”
then L must be recognizable.

Answers

Answered by sangeetakarwasra9630

0

Answer:

sorry I don't know the answer

Explanation:

because this is above my level

Again sorry

Previous Question

Next Question

Similar questions

History, 1 month ago

भारतीय समाजातील विविधता असले तरीही एकतेची भावना दिसून येते.

English, 1 month ago

how wiil it broken by you change to active voice...

Math, 1 month ago

divide ₹104 between gopi and vani in the ratio 5 ratio4...

Hindi, 3 months ago

अंग्रेज अफसर अलोपीदीन के इलाके में क्यों आते थे? (क) व्यापार करने ख) दावत खाने ग) शिकार खेलने (घ) जुआ खेलने घ...

Math, 3 months ago

Find a rational number between 1/2 and 1/3 .

English, 10 months ago

The men at the windows had not yet swooped into the Hall, like birds of prey from their high perches.which literary device is this...

English, 10 months ago

You can't drive over a new-made road, but after it's been in use for a while, the going’s smoother! ’ (a) Who is the speaker? Who is he speaking to? (b) Why does the speaker say these words? (c) What does he mean by these words?

Math, 10 months ago

what is the answer please...