$15\mathrm{.}6$: Turing Machine Definitions

Let M be a Turing machine whose only final state is h $($where h is not the initial state$)$ and such that there is no state p and no letters a and b such that $\backslash$delta $($p$,$ a$)=($h$,$ b$,$ L$)$ or $\backslash$delta $($p$,$ a$)=($h$,$ b$,$ R$).$ Then L$($M$)=.$