Homework 3 Discusion (due September 24): (Note: This is a change from the format and due date originally posted) . Design a Turing Machine to accept the language of words over ta, bi whose 2. Design a Turing Machine to accept the language of words over la, b) that begin with the symbol a and end with the symbol b. (This is problem 1 3. Design a Turing Machine to accept (a" bm a n, m> 0: (that is, n "a"s, followed by m "b's, follor.ed by n "a's) 4. Design a Turing Machine to compute fx. y) Cx, y. 5. Design a Turing Machine to compute Rx. y, 2) pix. y.z length is 3 or more. (This is problem 1.8.8 from the textbook.) The input and output for the last two problems will be written in unary-plus-one notation (that is, n will be represented as a input number. For eample, a Turing Machine to compute C2 (3, ) will begin with i m B11 on its tape, and it will end with 1 1 1 on the tape. string of n 1 Is), with a single blank in betwe Homework 3 Discusion (due September 24): (Note: This is a change from the format and due date originally posted) . Design a Turing Machine to accept the language of words over ta, bi whose 2. Design a Turing Machine to accept the language of words over la, b) that begin with the symbol a and end with the symbol b. (This is problem 1 3. Design a Turing Machine to accept (a" bm a n, m> 0: (that is, n "a"s, followed by m "b's, follor.ed by n "a's) 4. Design a Turing Machine to compute fx. y) Cx, y. 5. Design a Turing Machine to compute Rx. y, 2) pix. y.z length is 3 or more. (This is problem 1.8.8 from the textbook.) The input and output for the last two problems will be written in unary-plus-one notation (that is, n will be represented as a input number. For eample, a Turing Machine to compute C2 (3, ) will begin with i m B11 on its tape, and it will end with 1 1 1 on the tape. string of n 1 Is), with a single blank in betwe