Turing Machine for Language L = ww^r in Automata Theory

Start with some initial state q0, if we find 'a', we will change it to 'x' or if we find 'b', we will change it to 'y'. After updating the alphabet, we will move towards the right while skipping all the a's and the b's and go till the last blank i.e. 'B'. From 'B', take a left turn, and if the first alphabet was 'a', then we will find 'a' here which will be replaced by 'x' and if the first alphabet was 'b', then we will get b here which will be changed to 'y'. Then again we will move towards the left side to start the second iteration. turing machine in english automata lectures in english toc lectures in english atfl lectures in english introduction to turing machine definition of turing machine what is turing machine operations in turing machine turing machine turing machine example turing machine for wwr turing machine for ww^r tm for wwr tm for ww^r turing machine for the language ww^r cse gate gate exam tm pushdown automata example topgate construction of turing machine design a turing machine top gate questions cse gate examples accept a string by turing machine automata gate computer science computer science lectures automata for gate theory of computation toc atfl tafl automata theory & formal languages gate lectures automata lectures automata theory toc lectures toc for gate theory of computation lectures