This more complex example of a Turing Machine introduces two states that halt the machine: Y and N. We will see that Turing Machines can solve a much broader variety of decision problems than DFAs can.
No download links available.
