STOR072: Homework #2
Write two Turing Machines, one for each of the following jobs. In each case, give
the complete list of commands and the initial state. You can use IDEAS to try out
your Turing Machine on various examples.
EVEN-a-TESTER: Given as input a list of a’s, b’s, and c’s, stop in the Y state if
there are an even number of a’s, and stop in the N state if there are an odd number of
a’s. (It doesn’t matter how many of the other letters there are, nor what you leave on
the tape when you are finished.)
MINI-TRANSLATOR: Given as input a sequence of U’s, A’s, C’s and T’s, let’s
assume that a “codon” now consists of 2 nucleotides instead of 3. Suppose these
mRNA pairs are coded into amino acids by the following table:
second base
U C A G
UP AKX
C P R M T
A L D M W
G L X P W
X = stop codon
You want as output a list of letters (you can space them every 2 squares) which
correspond to the amino acids of the final protein. For example,
if the input were CUACCAAAGCUUA
then the output would be P D M M
(The stop codon is not part of the protein.)
first base
