“…Being in the sink state we push all symbols read onto the pushdown store. In this way, we can identify the moment in which the sink state has been entered and, thus, Transition function δ (1) δ(q 0 , a, ⊥) = (q 1 , A ⊥) (2) δ(q 0 , b, ⊥) = (q 1 , B ⊥) (3) δ(q 1 , a, A ) = (q 1 , A A ) (4) δ(q 1 , a, A) = (q 1 , A A) (5) δ(q 1 , b, A) = (q 1 , λ) (6) δ(q 1 , b, A ) = (q 0 , λ) (7) δ(q 1 , b, B ) = (q 1 , B B ) (8) δ (q 1 , b, B) = (q 1 , B B) (9) δ(q 1 , a, B) = (q 1 , λ) (10) δ (q 1 , a, B ) = (q 0 , λ) The idea of the construction is as follows. We use the stack for counting the difference between the number of a's and b's in the input.…”