Name: ____________________________________________________ Alpha: _____________________
Describe help received: _________________________________________________________________
Problem 2
Suppose we consider a JFLAP machine $M$ with $\Sigma = \Gamma =
\{a,b,c\}$.
Suppose $M$ is in state $q_3$ with tape and read/write head as
shown below:
originally the first square of the input

V
... a b b c b □ c ...
^read/write head
 Write the JFLAP TM configuration (i.e. a tuple!) of $M$
in this situation.
 Suppose $M'$ is a TM created by our algorithm for simulating a
JFLAP Turing Machine $M$. Write the TM configuration of
(i.e. a tuple!) of $M'$ when it is simulating the above
situation.
Problem 3
Suppose $M'$ is a TM created by our algorithm for simulating a
JFLAP Turing Machine $M$.
If $M'$ is in configuration
\[
\left( (q_3,1) , \$(□,b)(a,□), (□,□),
(b,□)(a,□)ab \right)
\]
 Write the JFLAP TM configuration (i.e. a tuple!) of $M$
in this situation.
 Suppose in $M$ that $\delta(q_3,□) = (q_1,a,R)$.
Write the configuration that TM $M'$ will be in one step
later in the computation.