3. (10 pts) Using the example Turing Machine of Figure 10.4 as a model, create a set of instructions so that the processor writes a "Y" in the empty cell if there is at least one 'b' anywhere in the sequence;
otherwise writes an “N”. HINT: The processor only needs two states, one state representing that no 'b'
has been seen and one state representing that at least one 'b' has been seen.
To test your work, make sure your Turing Machine "works" for these examples. In the examples, "_"
represents the empty cell.
CS 11200 Computer Science for Everyone
аааш
a baaa
Example 1:
Example 2:
Example 3:
Example 4
bbb
ba ba bab