Question Three 3 Marks a. Construct a Turing machine that transforms an initial tape of the form Om 100 (m and n 0's wit

[answerhappygod]

Question Three 3 Marks A Construct A Turing Machine That Transforms An Initial Tape Of The Form Om 100 M And N 0 S Wit 1 (82.15 KiB) Viewed 33 times

Question Three 3 Marks a. Construct a Turing machine that transforms an initial tape of the form Om 100 (m and n 0's with m; n>0 separated by a 1) into 0m1-01 (m and n O's with m; n> 0 separated by a 1 followed by a blank). The tape head should be at the 1 before and after the computation. Run your machine on the input 00100. (2Mark) b. Consider the language L = {w010w | wE Ld}: = Is this language recursively enumerable? Justify your answer. (1Mark)