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 {a,b} that recognizes the language consisting of all words that contain Nb's (N > 0, N is an integer) followed by N+1 a's. Test your program with the following input strings:

baa, bbbaa, bbaaaa, bbaabb, bbaaa