Subject: Theory of Automata and Formal Languages

Draw the turing machine for the language of a" 6" "d", where m and n must be equal Valid strings:{abcd, aabbcccddd, aaabbbccccdddd, ...}