One tape Turing machine for doubling words(strings)

491 Views Asked by At

I am going to design a Turing machine for doubling any words. My algorithm is such that for word $X$ as input, the output will be in the form $X@X$ which $@$ is a character. How can design an one-tape Turing machine that give exactly $XX$ as its output? For example, X=abba, XX=abbaabba. Thank you in advance for consideration.