Consider the following Turing Machine Show the execution tra

Consider the following Turing Machine: Show the execution traces using each of the following input strings: (a) aaa (b) aba (c) ababb (d) What does the machine do?

Solution

1) halts at state 4. Tape=>#aa

2) halts at state 4. Tape=>#ba

3) halts at state 4. Tape=>#babb

4) accepts strings starting with b and ending with a and of min length 2