This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: What is the resulting language L? 4) (S22) Which is true? a) A problem is solvable implies the problem is halfsolvable. b) A problem is halfsolvable implies the problem is solvable. Take home review questions 1) What is the type of an input instance in a language recognition problem? 2) Give both formulations (Input & Y/N question, 3 sets) of the LRP corresponding to the language L = the set of strings beginning with aaa over {a,b}. 3) What are Y(P), N(P), C(P), and I(P) for the following program? bool main(string x) { if ((x.length( ) % 2) = = 0) return (yes); else return(no); } Y(P) = N(P) = C(P) = I(P) = 4) For any program P that takes as input a string, can P ever solve a language other than Y(P)?...
View
Full Document
 Fall '07
 TORNG
 Sort, Prime number, Yesno question, input instances

Click to edit the document details