Topic: Formal Language, Grammars and Automata

13. Let L = { an bj CK 1 n 1 ^ n j 2n ^ 2n k 3n } be a language over = {a,b,c). Show how you construct a Turing machine M = (Q,1.,q0BF) such that L = L(M) and present complete sequences of moves for input strings aaabbbbbccccccc E L and abbbccc L