I stumbled upon the following post while learning about turing machines:
I kind of understand the intuition behind why a TM that only moves to the right works like a FSA but I can't think of a general way to create a let's say DFA (or NFA, doesn't really matter) which accepts the same language as a given right moving TM.
So my question would be:
Given an only right moving TM $M$, what would be a general method for constructing a DFA $D$ such that $L(M) = L(D)$?
Alternatively, given an only right moving TM $M$, how to construct a NFA $N$ such that $L(M) = L(N)$?