Problem 5 Suppose M is a Turing machine, and every transition either moves right (R) or stays put (S), but no transition moves left (L). Argue that L(M) is regular. Note these complications: M may halt before reading the entire input, it may take further steps when it sees blanks, and it may not halt at all. Problem 5 Suppose M is a Turing machine, and every transition either moves right (R) or stays put (S), but no transition moves left (L). Argue that L(M) is regular. Note these complications: M may halt before reading the entire input, it may take further steps when it sees blanks, and it may not halt at all