Information Technology Reference
In-Depth Information
a.
Run this Turing Machine for each of the following inputs,
and determine what is on the tape when processing stops.
i.
0000
ii.
1111
iii.
10011
b.
Describe in words what this Turing Machine does.
c.
Describe in words the motivation for states B and C. What
do each of these states tell you about processing of the in
put?
6.
The first example of Turing Machines in this chapter de
scribed an algorithm for computing a parity bit, based an
even number of 1's in a number. This is called even parity.
How would you change the Turing Machine so that the par
ity bit was set so the number of 1's was odd (e.g., odd parity)?
