ATC | VTU Syllabus | Turing Machine Design for Language of Even Palindromes in Theory of Computation

In Theory of computation, Turing machine is designed for language of even palindromes on {a,b}* and instantaneous description is also explained. TM reads input from left to right. It reads the first character , replaces it by blank 'B' and moves to right to find last character and replaces it by blank 'B' if the character is same as first what it read. The procedure repeats till it finds only blank symbols.