Learning

Outcome$($s$)$:

CLO$2$

Explain

Pushdown

automata and

Turing Machines

Question Two

Given the Turing Machine for the language $L$ where strings in $L$ have equal

number of a$\text{'}$s and b$\text{'}$s$.$

a$)$ Test the TM with the input "aabb" to see if it is accepted or not? Note

that $B=$Blanks, and the highlighted cell represents the tape head.

b$)$ For each step, you are required to show the tape head's location by

highlighting the cell and mention the current state in the first column.