- 7 20 Pts Consider The Following Turing Machine 909 9 9accarej R A B 0 1 B 0 1 9 Area R Qreb R Are 0 1 (54.65 KiB) Viewed 44 times
(7.) 20 pts Consider the following Turing machine: {909₁9₂9accarej} r = {a,b,0,1,*} b 0 1 9⁰ (area, R) (qreb, R) (are 0, R) (qrej 1, R) (q,, *, R) 9₁ (9,₁, 1, R) (9₁, 0, R) (qrej 0, R) (qrej 1, R) (9₂: *, L) (qreja, L) (qreb, L) (9₂, 2, L) (9₂, 1, L) (9 acc *, R) Show what will the Turing machine produce after it processes the input below and what the final state of the machine will be. You may show your steps on your answer sheet. Start state: q, tape as shown: 90 ★ a a b b a a b a b a Final state: tape as shown: S = 1