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 {p,q} that recognizes the language consisting of words having the form qNpNqN (N > 0, N is an integer). Test your program with the following input strings:

qpq, qqpqq, qqppq, qqppqq, qqppqqq