Refer to the following TM. We assume that the input string is put on the Tape with the symbol # inserted in front of it in cell i. For example, the input ba will be run with the Tape initially in the form #ba? In this chapter, we saw how to do this using TM states. Here, consider it already done. The TM is then a,a,R) (b,b R) (a,a,R) (b.B.R) START (A.A.R) (B.B,R) (A.AL) (X.X,L) (Y.yL) (b,b.L) (a,a,L) (b,Y.L) (e,X,L) (a.a.L) (b&t) (B,B,L) B.B.R) (A.A.L) (B.B.L) (A,A.R) (A.A.R (B.B,R) 10 13 8,L) (A,AL) (,AR (A.A.L) HALT The language this TM accepts is DOUBLEWORD, the set of all words of the form ss, where s is a nonnull string in (a+ b)* (see p. 200) (i) Explain the meaning of each state and prove that all words in DOUBLEWORD are accepted by this TM (ii) Show that all words not in DOUBLEWORD are rejected by this machine Refer to the following TM. We assume that the input string is put on the Tape with the symbol # inserted in front of it in cell i. For example, the input ba will be run with the Tape initially in the form #ba? In this chapter, we saw how to do this using TM states. Here, consider it already done. The TM is then a,a,R) (b,b R) (a,a,R) (b.B.R) START (A.A.R) (B.B,R) (A.AL) (X.X,L) (Y.yL) (b,b.L) (a,a,L) (b,Y.L) (e,X,L) (a.a.L) (b&t) (B,B,L) B.B.R) (A.A.L) (B.B.L) (A,A.R) (A.A.R (B.B,R) 10 13 8,L) (A,AL) (,AR (A.A.L) HALT The language this TM accepts is DOUBLEWORD, the set of all words of the form ss, where s is a nonnull string in (a+ b)* (see p. 200) (i) Explain the meaning of each state and prove that all words in DOUBLEWORD are accepted by this TM (ii) Show that all words not in DOUBLEWORD are rejected by this machine