A Turing machine that cannot move left and instead stays put is similar to the ordinary Turing machine except for the transition function: : Qxr →Qxr x {R,N}, where N means "stay put" leaving the read-head in place Argue these machines are less powerful than ordinary Turing machines and, in fact, correspond with the regular languages.