[Haskell-beginners] Turing machine that decides if a string is an element of an-bn-cn

Hi Folks, I implemented, in Haskell, a Turing Machine that decides if a string is a member of the language consisting of an equal number of a's, b's, and c's, i.e., anbncn. http://www.xfront.com/Turing-Machines/an-bn-cn/TM.hs.txt /Roger