Old MathJax webview

do all the four parts . if not I will dislike it and also I will report . please do it clearly with neat handwriting

explain clearly each and every step

4. a) Design a turing machine that computer the positive integer function fcx) = 2x-1 - b) Design a Turing machine that computes the function f(w)= ww, where we {a, byt 5. (a) Define recursively enumerable language ? show that ther crists a recursively enumerable. language L such that the complement of Lis not recursively enumerable b) Let u and La be two context free languages. Discuss the decidability of checking whether LOL2=0