JAVA PROGRAM help

Define a Turing machine for the language described below. Then write a test (JAVA) program to implement your Turing machine as an instance of your TM class. Note that you may have to deal with the halting problem for Turing machines.

A TM for alphabet {x,y} that recognizes the language consisting of all odd-length palindromes. Test your program with the following input strings:

xyx, yxxy, xxyxx, xyyxy, yxyxyxy