This model is called a Turing Machine, and it was invented and investigated by Alan Turing in the 1930's ... before we really had computers! Essentially, it is a finite automaton + an array. In particular:
For this class we played with examples of such machines using JFLAP. Once we're familiar with them informally, we'll go back and give formal definitions.
" in the transitions stands for a blank.
This machine writes a blank no matter what it reads, and keeps moving right. When reads the first blank (i.e. the end of the input) it halts. We specifically ran it in class on the input tape
Note: Please save each machine as a separate JFLAP file. You might need them later!