Share
Explore BrainMass

Automata and Computability

Let C be a language. Prove that C turing-recognizable if a decidable language D exists such that C = {x | y (x,y  D)}.

Attachments

$2.19