Deterministic uniquely-accepting PDA for {xcy∣x,y∈{a,b}∗∧∣x∣ab=∣y∣ba}
Write a deterministic uniquely-accepting PDA recognizing the words of the
form xcy, where x,y are words over {a,b} such that the number of
occurrences of ab in x is equal to the number of occurrences of ba in
y.