The language of any constant-time Turing machine is regular Suppose we have a Turing machine $M$ so that there is a constant $t$ such that the Turing machine always runs in time $t$ or less. Prove that the language of $M$ is regular. 


This seems to be a pretty well-known fact, but despite my research, I cannot seem to find a proof of this anywhere. Does someone know of one?
Hint: If the machine runs in time $t$ on all inputs then its decision only depends on the first $t$ symbols of the input.