Working with Turing Machine transitions

Question

Comments

consider a string in the language =aabbcc.

first 'a' make it as X and 'b' make it as Y and 'c' make it as Z.

=XaYbZc.

at state D transtion p=(X,X,R) then repeat same procedure.

=XXYYZZ.

at state A transition Q=(Y,Y,R) goto state E and skip Y's and Z's it accept.

hence P=(X,X,R) AND Q=(Y,Y,R)