Question: Can you help me with JFLAP and Single, Double, and Two Tape Turing machines.
Your solutions may be submitted as JFLAP solution files for full credit. HIGHLY recommend that you use that powerful software. It will make testing MUCH easier. In fact you will receive a 5% bonus if you do. The alphabet for all of the following problems is the same: A, B, C, null
All tapes read from left to right the same as in JFLAP.
1) single tape Turing machine: initial tape has (A+B+C)*
if AAA substring then it is rewritten as BBB
if CCC substring appears then all BBB substrings are rewritten as ABA
2) single tape Turing machine: initial tape has (A+B+C)* final tape has A*B*C*
3) double tape Turing:
tape 1 is blank
tape 2 is (A+B+C)*
final tape 1 is A*B*
final tape 2 is C*
4) double tape Turing:
initial tape 1 is (A+B+C)*
initial tape 2 is empty
final tape 1 is empty
final tape 2 contains only the character that is most commonly found on the initial tape 1
5. Two tape Turing machine
both tapes initially contain (A+B+C)*
each tape is read sequentially at the same time, e.g. position 0 on both tapes, then position 1 on both tapes etc.
if the characters match on both tapes at one specific position then nothing is changed
if the characters do not match then the characters are swapped.