Question: We want to construct a Turing machine M = { , , Q , , q , q a c c e p t ,
We want to construct a Turing machine with one tape, that accepts the language over the alphabet
We assume that, at the start of the computation, the tape head is on the leftmost symbol of the input string.
The idea is as follows.
We check whether the leftmost symbol on the tape is If so we delete it and move the tape head to the rightmost symbol on the tape. If the leftmost symbol is we
CS Assignment
Yiming Zhao
reject.
We check whether the rightmost symbol is If so we delete it and move the tape head left by one cell. If this cell contains we delete it and move the tape head back to the leftmost symbol and continue the above step. Otherwise, we reject.
We have tape alphabet and set of states Definitions of states are listed below.
the start state, the tape head is on the leftmost symbol of the input string.
the accept state.
the reject state.
we have deleted the leftmost of the current string; the tape head is moving to the right.
the tape head is at the rightmost symbol, and delete it if it is
we have deleted one symbol from the right. The tape head is at the left neighbor of the original rightmost We delete it if it is
we are moving the tape head to the leftmost symbol after deleting two s from the right end of the current string on the tape.
The transition function is specified by the following instructions. But some instructions are missing. Please complete this machine by adding those missing transitions. Please just use the notation defined above.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
