Exercise 20:

Deterministic uniquely-accepting PDA for {xcyx,y{a,b}xab=yba}\{ xcy \mid x,y\in\{a,b\}^* \wedge |x|_{ab}=|y|_{ba} \}
Write a deterministic uniquely-accepting PDA recognizing the words of the form xcyxcy, where x,yx,y are words over {a,b}\{a,b\} such that the number of occurrences of abab in xx is equal to the number of occurrences of baba in yy.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.