Question

Design a DPDA M as a two-tape turing machine such that L(M) = {aⁿbⁿ : n>=0}

Answer 1

The language should be like,
On input string w, while there are unmarked a's,
then do
Mark the left most a
Scan right till the leftmost unmarked b;
if there is no such b then crash
Mark the leftmost b
done
Check to see that there are no unmarked b's;
if there are then crash
accept.

formal d串n:tion B. R