Would a Turing Machine that cannot move left, but can move right or stay put recognize only regular languages? And how does it compare to a machine the can do the same, but also move left?
-
$\begingroup$ What do you think? You may want to read does stay put TM recognizes same languages as standard TM? and single-tape Turing Machines with write-protected input recognize only Regular Languages to find some ideas and answers. $\endgroup$ – John L. Apr 5 '19 at 2:40
-
$\begingroup$ cs.stackexchange.com/q/42723/755 $\endgroup$ – D.W.♦ Apr 5 '19 at 5:35
