For consider the following TM:

The language accepted by this TM is all words with an odd number of letters that have a as the middle letter. Show that this is true by explaining the algorithm the machine uses and the meaning of each state. Pay attention to the two necessary parts that must always be demonstrated:
(i) Anything that has an a in the middle will get to HALT.
(ii) Anything that gets to HALT has an a in the middle.

Transcribed Image Text:

(a,a,L) (b,b,L) (#,#,R) 1 START (b.b,L) (a,a,L) (b,#,R) (a,#,R) 6 (#,#,R) (A.J.R) 2 3 HALT (b.#.L) (a,#,L) (a,a,R) (b,b,R) (A.A.L) (#,#,L) (b.b.R) (a.a,R) 4 (a.a,R) (b.b,R)