Question

It wants a diagram

Construct a TM M4 which accepts the language [w2w | w in (0,1)). This means, any input that comprises two copies of a binary string w separated by a single 2 symbol should be accepted. Any other input should be rejected. The input alphabet is (0,1,2). The tape alphabet contains 0, 1,2,_and you may use additional symbols 3, 4, , 9 if you wish (M4 can be constructed comfortably with just one additional symbol 3). The tape's content after M4 halts does not matter. Submit a representation of M4 as described above Answer: (penalty regime: 10, 20, %) Help Precheck Check

Answer 1

• ABCD to match 0 in w
• AEGD to match 1 in w
• Once all the symbols are over in w, accepting using AHF

33-> Li 3/3- 01弓 則マす. (c 013 010→ 2/2ど 3)22 313 →